{"id":"https://openalex.org/W2084845949","doi":"https://doi.org/10.1137/100801652","title":"Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems","display_name":"Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2084845949","doi":"https://doi.org/10.1137/100801652","mag":"2084845949"},"language":"en","primary_location":{"id":"doi:10.1137/100801652","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100801652","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Renato D. C. Monteiro","raw_affiliation_strings":["monteiro@isye.gatech.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"monteiro@isye.gatech.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053683082","display_name":"B. F. Svaiter","orcid":"https://orcid.org/0000-0003-3656-9883"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B. F. Svaiter","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5443,"has_fulltext":false,"cited_by_count":122,"citation_normalized_percentile":{"value":0.96309315,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"21","issue":"4","first_page":"1688","last_page":"1720"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12809","display_name":"Contact Mechanics and Variational Inequalities","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8886663913726807},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.8345460891723633},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6483891606330872},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5731873512268066},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.48348718881607056},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45574310421943665},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44809746742248535},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.4198477268218994},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4172070324420929},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.26799148321151733},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06474366784095764}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8886663913726807},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.8345460891723633},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6483891606330872},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5731873512268066},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.48348718881607056},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45574310421943665},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44809746742248535},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.4198477268218994},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4172070324420929},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.26799148321151733},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06474366784095764},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100801652","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100801652","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W47137165","https://openalex.org/W163258351","https://openalex.org/W257907672","https://openalex.org/W1499439642","https://openalex.org/W1543439990","https://openalex.org/W1565352424","https://openalex.org/W1574645350","https://openalex.org/W1966953121","https://openalex.org/W2004775756","https://openalex.org/W2012117745","https://openalex.org/W2038497950","https://openalex.org/W2052769657","https://openalex.org/W2055467852","https://openalex.org/W2075226379","https://openalex.org/W2081316950","https://openalex.org/W2084777452","https://openalex.org/W2089559088","https://openalex.org/W2116174279","https://openalex.org/W2132677982","https://openalex.org/W2138216979","https://openalex.org/W2164224215","https://openalex.org/W2493382624"],"related_works":["https://openalex.org/W4236459141","https://openalex.org/W4205304778","https://openalex.org/W2020252434","https://openalex.org/W73248859","https://openalex.org/W2584253892","https://openalex.org/W2350324449","https://openalex.org/W119381072","https://openalex.org/W2034033896","https://openalex.org/W4240399920","https://openalex.org/W2901108086"],"abstract_inverted_index":{"In":[0,60],"this":[1],"paper,":[2],"we":[3,47,66,90],"consider":[4],"both":[5],"a":[6,102],"variant":[7],"of":[8,17,36,57,63,78,84,94,105,127],"Tseng's":[9],"modified":[10],"forward-backward":[11],"splitting":[12],"method":[13,19,41],"and":[14,45,116],"an":[15,79,85],"extension":[16],"Korpelevich's":[18],"for":[20,51,71,112],"solving":[21],"hemivariational":[22],"inequalities":[23],"with":[24],"Lipschitz":[25],"continuous":[26],"operators.":[27],"By":[28],"showing":[29],"that":[30,83],"these":[31,72],"methods":[32,73],"are":[33,131],"special":[34],"cases":[35],"the":[37,61,92,95,125],"hybrid":[38],"proximal":[39],"extragradient":[40],"introduced":[42],"by":[43,98],"Solodov":[44],"Svaiter,":[46],"derive":[48,68],"iteration-complexity":[49],"bounds":[50,70],"them":[52,100],"to":[53,74,101,122],"obtain":[54,75],"different":[55],"types":[56],"approximate":[58,80,86],"solutions.":[59],"context":[62],"saddle-point":[64],"problems,":[65,110],"also":[67],"complexity":[69],"another":[76],"type":[77],"solution,":[81],"namely,":[82],"saddle":[87],"point.":[88],"Finally,":[89],"illustrate":[91],"usefulness":[93],"above":[96],"results":[97],"applying":[99],"large":[103],"class":[104],"linearly":[106],"constrained":[107],"convex":[108],"programming":[109,115],"including,":[111],"example,":[113],"cone":[114],"problems":[117],"whose":[118],"objective":[119],"functions":[120],"converge":[121],"infinity":[123],"as":[124],"boundaries":[126],"their":[128],"effective":[129],"domains":[130],"approached.":[132]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}