{"id":"https://openalex.org/W4392709902","doi":"https://doi.org/10.1137/23m1558677","title":"Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems","display_name":"Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems","publication_year":2024,"publication_date":"2024-03-12","ids":{"openalex":"https://openalex.org/W4392709902","doi":"https://doi.org/10.1137/23m1558677"},"language":"en","primary_location":{"id":"doi:10.1137/23m1558677","is_oa":false,"landing_page_url":"https://doi.org/10.1137/23m1558677","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/A5055895298","display_name":"Yangyang Xu","orcid":"https://orcid.org/0000-0002-4163-3723"},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yangyang Xu","raw_affiliation_strings":["Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 USA","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055895298"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":1.9768,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.83074753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"34","issue":"1","first_page":"1006","last_page":"1044"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9921000003814697,"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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8480945825576782},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.8355655670166016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6124235391616821},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.5808847546577454},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5774800181388855},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5647101998329163},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48466140031814575},{"id":"https://openalex.org/keywords/composite-number","display_name":"Composite number","score":0.4699791967868805},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4363316297531128},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.42222708463668823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3864310085773468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18721291422843933},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13136857748031616},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12002044916152954},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09846487641334534}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8480945825576782},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.8355655670166016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6124235391616821},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.5808847546577454},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5774800181388855},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5647101998329163},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48466140031814575},{"id":"https://openalex.org/C104779481","wikidata":"https://www.wikidata.org/wiki/Q50707","display_name":"Composite number","level":2,"score":0.4699791967868805},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4363316297531128},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.42222708463668823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3864310085773468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18721291422843933},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13136857748031616},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12002044916152954},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09846487641334534},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/23m1558677","is_oa":false,"landing_page_url":"https://doi.org/10.1137/23m1558677","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.46000000834465027,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1986046400","https://openalex.org/W2005895359","https://openalex.org/W2029184861","https://openalex.org/W2030161963","https://openalex.org/W2125417745","https://openalex.org/W2609535051","https://openalex.org/W2892002891","https://openalex.org/W2963128910","https://openalex.org/W3016604587","https://openalex.org/W3017141419","https://openalex.org/W3092401114","https://openalex.org/W3096831136","https://openalex.org/W3134825596","https://openalex.org/W3206964102","https://openalex.org/W4212774754","https://openalex.org/W4313481921","https://openalex.org/W4319451486"],"related_works":["https://openalex.org/W2015288657","https://openalex.org/W263682811","https://openalex.org/W2564172750","https://openalex.org/W2846499288","https://openalex.org/W3197592642","https://openalex.org/W3199158697","https://openalex.org/W2356977358","https://openalex.org/W2302465375","https://openalex.org/W2098528027","https://openalex.org/W2088605360"],"abstract_inverted_index":{".Minimax":[0],"problems":[1,31,54],"have":[2,13,57,226],"recently":[3],"attracted":[4],"a":[5,35,73,83,106,119,144,151,173,188,196,234,242,254],"lot":[6],"of":[7,26,76,93,105,117,131,143,177,192,204,245,263],"research":[8],"interests.":[9],"A":[10],"few":[11],"efforts":[12],"been":[14],"made":[15],"to":[16,85,114,157,186,240,259],"solve":[17],"decentralized":[18,78,145,164],"nonconvex":[19],"strongly-concave":[20],"(NCSC)":[21],"minimax-structured":[22],"optimization;":[23],"however,":[24],"all":[25],"them":[27],"focus":[28],"on":[29,37,49,61,72,136,166,233,253],"smooth":[30],"with":[32],"at":[33],"most":[34,99],"constraint":[36,96],"the":[38,46,77,87,98,115,129,132,137,141,178,193,201,205,208,218,246,261,264],"maximization":[39,65,103],"variable.":[40],"In":[41,127],"this":[42,212],"paper,":[43],"we":[44,214],"make":[45],"first":[47],"attempt":[48],"solving":[50,167],"composite":[51],"NCSC":[52,168],"minimax":[53,79,169,267],"that":[55,81,112,216],"can":[56,225],"convex":[58],"nonsmooth":[59],"terms":[60],"both":[62],"minimization":[63],"and":[64,123,134,181,207],"variables.":[66],"Our":[67],"algorithm":[68,180,224],"is":[69,198,221],"designed":[70],"based":[71],"novel":[74],"reformulation":[75,149,206],"problem":[80],"introduces":[82],"multiplier":[84],"absorb":[86],"dual":[88,94,110,138,219],"consensus":[89,95,135],"constraint.":[90],"The":[91],"removal":[92],"enables":[97],"aggressive":[100],"(i.e.,":[101],"local":[102],"instead":[104],"gradient":[107],"ascent":[108],"step)":[109],"update":[111],"leads":[113],"benefit":[116],"taking":[118],"larger":[120],"primal":[121],"stepsize":[122],"better":[124],"complexity":[125,184,228],"results.":[126],"addition,":[128],"decoupling":[130],"nonsmoothness":[133],"variable":[139],"eases":[140],"analysis":[142],"algorithm;":[146],"thus":[147],"our":[148,223],"creates":[150],"new":[152,159],"way":[153],"for":[154],"interested":[155],"researchers":[156],"design":[158],"(and":[160],"possibly":[161],"more":[162],"efficient)":[163],"methods":[165],"problems.":[170],"We":[171],"show":[172,215],"global":[174],"convergence":[175],"result":[176,185],"proposed":[179,265],"an":[182],"iteration":[183],"produce":[187,241],"(near)":[189,202],"stationary":[190],"point":[191,244],"reformulation.":[194],"Moreover,":[195],"relation":[197],"established":[199],"between":[200],"stationarities":[203],"original":[209,247],"formulation.":[210,248],"With":[211],"relation,":[213],"when":[217],"regularizer":[220],"smooth,":[222],"lower":[227],"results":[229],"(with":[230],"reduced":[231],"dependence":[232],"condition":[235],"number)":[236],"than":[237],"existing":[238],"ones":[239],"near-stationary":[243],"Numerical":[249],"experiments":[250],"are":[251],"conducted":[252],"distributionally":[255],"robust":[256],"logistic":[257],"regression":[258],"demonstrate":[260],"performance":[262],"algorithm.Keywordscomposite":[266],"problemnonconvex":[268],"strongly-concavedecentralized":[269],"algorithmiteration":[270],"complexityMSC":[271],"codes90C3090C47":[272]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}