{"id":"https://openalex.org/W4390747415","doi":"https://doi.org/10.1137/22m1503129","title":"Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming","display_name":"Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming","publication_year":2024,"publication_date":"2024-01-11","ids":{"openalex":"https://openalex.org/W4390747415","doi":"https://doi.org/10.1137/22m1503129"},"language":"en","primary_location":{"id":"doi:10.1137/22m1503129","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1503129","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/A5072236090","display_name":"Weiwei Kong","orcid":"https://orcid.org/0000-0002-4700-619X"},"institutions":[{"id":"https://openalex.org/I1289243028","display_name":"Oak Ridge National Laboratory","ror":"https://ror.org/01qz5mb56","country_code":"US","type":"facility","lineage":["https://openalex.org/I1289243028","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I4210159294"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Weiwei Kong","raw_affiliation_strings":["Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37830 USA"],"raw_orcid":"https://orcid.org/0000-0002-4700-619X","affiliations":[{"raw_affiliation_string":"Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37830 USA","institution_ids":["https://openalex.org/I1289243028"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato D. C. Monteiro","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205 USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072236090"],"corresponding_institution_ids":["https://openalex.org/I1289243028"],"apc_list":null,"apc_paid":null,"fwci":0.7552,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58449557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"34","issue":"1","first_page":"201","last_page":"224"},"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.9987999796867371,"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.9987999796867371,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9975000023841858,"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.9968000054359436,"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.836363673210144},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.8263130187988281},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.7808781266212463},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5897488594055176},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5587772727012634},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5246663093566895},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5114737749099731},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5089750289916992},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.49188971519470215},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47791773080825806},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.46594345569610596},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.45905670523643494},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44262874126434326},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4245072901248932},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4157061278820038},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4144435524940491},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20663753151893616},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12841960787773132}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.836363673210144},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.8263130187988281},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.7808781266212463},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5897488594055176},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5587772727012634},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5246663093566895},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5114737749099731},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5089750289916992},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.49188971519470215},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47791773080825806},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.46594345569610596},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.45905670523643494},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44262874126434326},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4245072901248932},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4157061278820038},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4144435524940491},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20663753151893616},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12841960787773132},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/22m1503129","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1503129","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":[],"awards":[{"id":"https://openalex.org/G203625172","display_name":null,"funder_award_id":"DE--AC05--00OR22725","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G288011233","display_name":null,"funder_award_id":"FA9550-22-1-0088","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G5016495680","display_name":"TRIPODS: Transdisciplinary Research Institute for Advancing Data Science (TRIAD)","funder_award_id":"1740776","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6532760691","display_name":null,"funder_award_id":"N00014-18-1-2077","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W74105626","https://openalex.org/W1965650079","https://openalex.org/W1992841740","https://openalex.org/W2039151776","https://openalex.org/W2045079045","https://openalex.org/W2058532290","https://openalex.org/W2094631364","https://openalex.org/W2135779729","https://openalex.org/W2142574689","https://openalex.org/W2143552821","https://openalex.org/W2785011264","https://openalex.org/W2962853966","https://openalex.org/W2964271484","https://openalex.org/W2980884817","https://openalex.org/W3018500446","https://openalex.org/W3048490699","https://openalex.org/W3080748381","https://openalex.org/W3103984481","https://openalex.org/W3120796151","https://openalex.org/W4233197277","https://openalex.org/W4247206752","https://openalex.org/W4292363360"],"related_works":["https://openalex.org/W2360271985","https://openalex.org/W2131718214","https://openalex.org/W2027659296","https://openalex.org/W2002987466","https://openalex.org/W2070276483","https://openalex.org/W1903454366","https://openalex.org/W4313189992","https://openalex.org/W2615021531","https://openalex.org/W2030310352","https://openalex.org/W1970914972"],"abstract_inverted_index":{".This":[0],"paper":[1,121],"proposes":[2],"and":[3,53,77,84],"analyzes":[4],"a":[5,38,55,72,107],"dampened":[6],"proximal":[7,42],"alternating":[8],"direction":[9],"method":[10,127],"of":[11,25,33,36,40,64,98,115,119,125],"multipliers":[12],"(DP.ADMM)":[13],"for":[14,106],"solving":[15],"linearly":[16],"constrained":[17,100],"nonconvex":[18,140],"optimization":[19],"problems":[20],"where":[21],"the":[22,26,61,65,81,99,116,120,126,136],"smooth":[23],"part":[24],"objective":[27],"function":[28,67],"is":[29,88,122,128],"nonseparable.":[30],"Each":[31],"iteration":[32],"DP.ADMM":[34,91],"consists":[35],"(i)":[37],"sequence":[39],"partial":[41],"augmented":[43],"Lagrangian":[44,145],"(AL)":[45],"updates,":[46],"(ii)":[47],"an":[48,93],"under-relaxed":[49],"Lagrange":[50],"multiplier":[51],"update,":[52],"(iii)":[54],"novel":[56],"test":[57],"to":[58],"check":[59],"whether":[60],"penalty":[62],"parameter":[63],"AL":[66],"should":[68],"be":[69],"updated.":[70],"Under":[71],"basic":[73],"Slater":[74],"point":[75,97],"condition":[76],"some":[78],"requirements":[79],"on":[80,135],"dampening":[82],"factor":[83],"under-relaxation":[85],"parameter,":[86],"it":[87],"shown":[89],"that":[90,123],"obtains":[92],"approximate":[94],"first-order":[95],"stationary":[96],"problem":[101],"in":[102],"\\({\\cal":[103],"O}(\\varepsilon^{-3})\\)":[104],"iterations":[105],"given":[108],"numerical":[109],"tolerance":[110],"\\(\\varepsilon":[111],"\\gt":[112],"0\\).":[113],"One":[114],"main":[117],"novelties":[118],"convergence":[124],"obtained":[129],"without":[130],"requiring":[131],"any":[132],"rank":[133],"assumptions":[134],"constraint":[137],"matrices.Keywordsproximal":[138],"ADMMnonseparable":[139],"composite":[141],"optimizationiteration":[142],"complexityunder-relaxed":[143],"updateaugmented":[144],"functionMSC":[146],"codes65K1090C2590C2690C3090C60":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}