{"id":"https://openalex.org/W7213530129","doi":"https://doi.org/10.48550/arxiv.2609.17973","title":"Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization","display_name":"Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization","publication_year":2026,"publication_date":"2026-09-16","ids":{"openalex":"https://openalex.org/W7213530129","doi":"https://doi.org/10.48550/arxiv.2609.17973"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.17973","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17973","pdf_url":"https://arxiv.org/pdf/2609.17973","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.17973","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5152019167","display_name":"Minghao Zhang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I113940042","display_name":"Shanghai University","ror":"https://ror.org/006teas31","country_code":"CN","type":"education","lineage":["https://openalex.org/I113940042"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhang, Minghao","raw_affiliation_strings":["Department of Mathematics , College of Sciences , Shanghai University , Shanghai , 200444 , P.R.China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , College of Sciences , Shanghai University , Shanghai , 200444 , P.R.China","institution_ids":["https://openalex.org/I113940042"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5125193321","display_name":"Zi Xu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I113940042","display_name":"Shanghai University","ror":"https://ror.org/006teas31","country_code":"CN","type":"education","lineage":["https://openalex.org/I113940042"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xu, Zi","raw_affiliation_strings":["Department of Mathematics , College of Sciences , Shanghai University , Shanghai , 200444 , P.R.China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics , College of Sciences , Shanghai University , Shanghai , 200444 , P.R.China","institution_ids":["https://openalex.org/I113940042"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I113940042"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.7250999808311462,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.7250999808311462,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.2125999927520752,"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.021299999207258224,"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/gradient-complexity","display_name":"gradient complexity","score":0.6200000047683716},{"id":"https://openalex.org/keywords/complexity-lower-bounds","display_name":"complexity lower bounds","score":0.7020000219345093},{"id":"https://openalex.org/keywords/warm-start-initialization","display_name":"warm-start initialization","score":0.5899999737739563},{"id":"https://openalex.org/keywords/saddle-point-problems","display_name":"saddle point problems","score":0.33000001311302185}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.8553000092506409},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6966999769210815},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6771000027656555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6017000079154968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.531000018119812},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.524399995803833},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5059999823570251},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.501800000667572},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4966999888420105},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.49239999055862427},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.47130000591278076},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4672999978065491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.447299987077713},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.41830000281333923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3822999894618988},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3806000053882599},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.32679998874664307},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.2662000060081482},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.17973","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17973","pdf_url":"https://arxiv.org/pdf/2609.17973","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.17973","doi":"https://doi.org/10.48550/arxiv.2609.17973","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.17973","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.17973","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17973","pdf_url":"https://arxiv.org/pdf/2609.17973","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213530129.pdf","grobid_xml":"https://content.openalex.org/works/W7213530129.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W2766533971","https://openalex.org/W2991497298","https://openalex.org/W3134825596","https://openalex.org/W4313481921","https://openalex.org/W7129486269"],"related_works":["https://openalex.org/W7213862717","https://openalex.org/W7213608555","https://openalex.org/W7214722935","https://openalex.org/W7129486269","https://openalex.org/W7213350592","https://openalex.org/W7027361433","https://openalex.org/W7213372651","https://openalex.org/W4313481921","https://openalex.org/W2954249541","https://openalex.org/W3048490699"],"abstract_inverted_index":{"We":[0,109],"introduce":[1],"a":[2,25,52,90,112,140,174],"new":[3],"single-loop":[4,43,175],"algorithmic":[5,176],"framework":[6,184],"for":[7,117,143,189],"smooth":[8],"nonconvex--concave":[9],"minimax":[10],"optimization.":[11],"The":[12,206],"resulting":[13],"projected":[14,19,121],"damped":[15],"extragradient":[16,20],"method":[17,37,50,154],"combines":[18],"updates,":[21],"dual":[22,70,179,197],"momentum,":[23],"and":[24,33,73,83,215],"moving":[26],"proximal":[27],"center.":[28],"Under":[29,178],"both":[30,190],"the":[31,39,60,66,69,80,84,94,130,161,170,182,196],"optimization-stationarity":[32],"game-stationarity":[34],"criteria,":[35,192],"our":[36,49,134,153],"achieves":[38,51,155,185],"best-known":[40,162],"complexity":[41,54,95,163,172,188],"among":[42],"first-order":[44,123,166],"methods.":[45,124],"For":[46,150],"optimization":[47,118,144],"stationarity,":[48,152],"gradient":[53,61,157],"of":[55,68,115,133,164],"$O(L^2D_Y\\bar\u0394_0\\varepsilon^{-3})$,":[56],"where":[57,107,193],"$L$":[58],"is":[59,75,136,195,210],"Lipschitz":[62],"constant,":[63],"$D_Y$":[64],"bounds":[65],"diameter":[67],"feasible":[71],"set,":[72],"$\\bar\u0394_0$":[74],"an":[76,103,202],"initialization":[77,204,216],"quantity":[78],"involving":[79],"value-function":[81],"gap":[82],"initial":[85],"gradients.":[86],"Moreover,":[87],"by":[88],"incorporating":[89],"fixed-center":[91],"warm-up":[92],"phase,":[93],"can":[96],"be":[97],"improved":[98],"to":[99,102,139,201],"$O(L^2D_Y\u0394_\u03d5\\varepsilon^{-3})$,":[100],"up":[101,138,200],"additive":[104,203],"lower-order":[105],"cost,":[106],"$\u0394_\u03d5:=\u03d5(x_0)-\\inf_x\u03d5(x)$.":[108],"further":[110],"establish":[111],"lower":[113,126],"bound":[114,127],"$\u03a9(L^2D_Y\u0394_\u03d5\\varepsilon^{-3})$":[116],"stationarity":[119,145,191],"over":[120],"zero-respecting":[122],"This":[125,159],"proves":[128],"that":[129],"warm-started":[131],"version":[132],"algorithm":[135],"optimal":[137,211],"constant":[141],"factor":[142],"within":[146],"this":[147],"oracle":[148],"class.":[149],"game":[151],"$\\mathcal{O}\\!(L^{3/2}D_Y^{1/2}\u0394_\u03d5\\varepsilon^{-5/2})$":[156],"complexity.":[158],"matches":[160],"multi-loop":[165],"methods,":[167],"thereby":[168],"establishing":[169],"same":[171],"with":[173],"structure.":[177],"strong":[180],"concavity,":[181],"proposed":[183],"$O\\!(\\sqrt\u03ba\\,L\u0394_\u03d5\\varepsilon^{-2})$":[186],"leading":[187],"$\u03ba=L/\u03bc$":[194],"condition":[198],"number,":[199],"cost.":[205],"$\\varepsilon^{-2}$":[207],"accuracy":[208],"dependence":[209],"under":[212],"fixed":[213],"regularity":[214],"bounds.":[217]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-18T00:00:00"}