{"id":"https://openalex.org/W7164410579","doi":"https://doi.org/10.48550/arxiv.2606.11800","title":"Accelerated Implicit GDA Schemes: Theoretical Guarantees and Application to Proximal Augmented Lagrangian Methods","display_name":"Accelerated Implicit GDA Schemes: Theoretical Guarantees and Application to Proximal Augmented Lagrangian Methods","publication_year":2026,"publication_date":"2026-06-10","ids":{"openalex":"https://openalex.org/W7164410579","doi":"https://doi.org/10.48550/arxiv.2606.11800"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.11800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11800","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,"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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.11800","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138477968","display_name":"Jiaqi Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Jiaqi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138395707","display_name":"Bin Shi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shi, Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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.9538999795913696,"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.9538999795913696,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.023399999365210533,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.006800000090152025,"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/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.7552000284194946},{"id":"https://openalex.org/keywords/ode","display_name":"Ode","score":0.7526000142097473},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5011000037193298},{"id":"https://openalex.org/keywords/variational-inequality","display_name":"Variational inequality","score":0.46860000491142273},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.46650001406669617},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4584999978542328},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4449999928474426},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4300999939441681},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.421099990606308}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.7552000284194946},{"id":"https://openalex.org/C34862557","wikidata":"https://www.wikidata.org/wiki/Q178985","display_name":"Ode","level":2,"score":0.7526000142097473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6654999852180481},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5701000094413757},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5476999878883362},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5011000037193298},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.46860000491142273},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.46650001406669617},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4584999978542328},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4300999939441681},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.421099990606308},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.41130000352859497},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.3555999994277954},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3418999910354614},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.33880001306533813},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.32440000772476196},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C79379906","wikidata":"https://www.wikidata.org/wiki/Q3174497","display_name":"Dynamical systems theory","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2556999921798706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.11800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11800","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,"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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.11800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.11800","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,"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Convex":[0],"optimization":[1,136],"problems":[2],"with":[3,151],"linear":[4],"equality":[5],"constraints":[6],"arise":[7],"ubiquitously":[8],"in":[9,131],"scientific":[10],"computing,":[11],"machine":[12],"learning,":[13],"and":[14,27,174,228,251],"control":[15],"theory.":[16],"Classical":[17],"Krylov":[18],"methods":[19,32],"are":[20],"effective":[21],"but":[22],"rely":[23],"on":[24,156],"problem-specific":[25],"preconditioners":[26],"high":[28],"memory.":[29],"Conversely,":[30],"gradient-based":[31],"like":[33],"the":[34,69,74,78,99,111,119,170,175,207,213,218,236,253,256],"augmented":[35,70],"Lagrangian":[36,71],"method":[37],"(ALM)":[38],"avoid":[39],"these":[40,142,248],"issues":[41],"yet":[42],"suffer":[43],"from":[44,118,133],"slow":[45],"outer":[46,79],"iterations.":[47],"Developing":[48],"accelerated":[49],"outer-iteration":[50],"schemes,":[51],"therefore,":[52],"remains":[53],"a":[54,65,124,129,157,180,187,223],"critical":[55],"research":[56],"objective.":[57],"In":[58],"this":[59,94],"study,":[60],"we":[61,108,144,184,221,241],"demonstrate":[62,252],"that":[63,93,110],"incorporating":[64],"proximal":[66,75],"operation":[67],"into":[68],"framework":[72],"yields":[73],"ALM,":[76],"where":[77],"iteration":[80],"is":[81],"equivalent":[82],"to":[83,98,123,137,217,246],"an":[84,147,163,201,230],"implicit":[85,148,191],"gradient":[86,176],"descent-ascent":[87],"(GDA)":[88],"scheme.":[89],"We":[90],"further":[91],"establish":[92],"equivalence":[95],"extends":[96],"naturally":[97],"setting":[100],"of":[101,189,255],"variable":[102,152],"step":[103,153],"sizes.":[104],"Through":[105],"Lyapunov":[106],"analysis,":[107],"show":[109],"underlying":[112],"potential":[113],"function":[114],"must":[115],"be":[116],"shifted":[117],"conventional":[120],"objective":[121,172,209,238],"gap":[122,173],"variational":[125],"inequality":[126],"measure,":[127],"signaling":[128],"shift":[130],"perspective":[132],"pure":[134],"convex":[135],"minimax":[138],"optimization.":[139],"Motivated":[140],"by":[141,195],"observations,":[143],"first":[145],"develop":[146],"GDA":[149,192,226],"scheme":[150,227],"sizes":[154],"based":[155],"continuous-time":[158],"ODE":[159,182,215],"framework,":[160,183],"which":[161,199],"achieves":[162,200],"$o(1/k)$":[164,231],"last-iterate":[165,203,232],"convergence":[166,204,233],"rate":[167,205,234],"for":[168,206,235],"both":[169],"primal-dual":[171,208,237],"norm.":[177],"Building":[178],"upon":[179],"second-order":[181,214],"then":[185],"propose":[186],"family":[188],"Nesterov-type":[190],"schemes":[193],"parameterized":[194],"$r":[196],"\\geq":[197],"0$,":[198],"$o(1/k^{r+1})$":[202],"gap.":[210,239],"Furthermore,":[211],"specializing":[212],"formulation":[216],"case":[219],"$r=0$,":[220],"derive":[222],"corresponding":[224],"explicit":[225],"prove":[229],"Finally,":[240],"present":[242],"several":[243],"numerical":[244],"experiments":[245],"validate":[247],"theoretical":[249],"results":[250],"effectiveness":[254],"proposed":[257],"methods.":[258]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-12T00:00:00"}