{"id":"https://openalex.org/W2963073480","doi":"https://doi.org/10.1137/16m1082305","title":"Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming","display_name":"Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2963073480","doi":"https://doi.org/10.1137/16m1082305","mag":"2963073480"},"language":"en","primary_location":{"id":"doi:10.1137/16m1082305","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1082305","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/I17301866","display_name":"University of Alabama","ror":"https://ror.org/03xrrjk67","country_code":"US","type":"education","lineage":["https://openalex.org/I17301866"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yangyang Xu","raw_affiliation_strings":["Department of Mathematics, University of Alabama, Tuscaloosa, AL"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Alabama, Tuscaloosa, AL","institution_ids":["https://openalex.org/I17301866"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055895298"],"corresponding_institution_ids":["https://openalex.org/I17301866"],"apc_list":null,"apc_paid":null,"fwci":8.6327,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.98782956,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"27","issue":"3","first_page":"1459","last_page":"1484"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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.996999979019165,"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.9958000183105469,"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/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.7924692630767822},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.7822683453559875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7429044842720032},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.634377658367157},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.6224349141120911},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5611098408699036},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5545248985290527},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46998608112335205},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4597809910774231},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.44509634375572205},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.44457677006721497},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41065287590026855},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.18197759985923767},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.1792527139186859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14176377654075623},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06859689950942993}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.7924692630767822},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.7822683453559875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7429044842720032},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.634377658367157},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.6224349141120911},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5611098408699036},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5545248985290527},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46998608112335205},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4597809910774231},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.44509634375572205},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44457677006721497},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41065287590026855},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.18197759985923767},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.1792527139186859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14176377654075623},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06859689950942993},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1082305","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1082305","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1549918636","https://openalex.org/W1947202642","https://openalex.org/W1968154520","https://openalex.org/W1972552174","https://openalex.org/W1973706450","https://openalex.org/W1978333359","https://openalex.org/W1987083649","https://openalex.org/W1998991750","https://openalex.org/W2000955051","https://openalex.org/W2010286849","https://openalex.org/W2024484010","https://openalex.org/W2024729328","https://openalex.org/W2030161963","https://openalex.org/W2045079045","https://openalex.org/W2076261573","https://openalex.org/W2092663520","https://openalex.org/W2092851214","https://openalex.org/W2097845889","https://openalex.org/W2100556411","https://openalex.org/W2105693192","https://openalex.org/W2127447444","https://openalex.org/W2131328016","https://openalex.org/W2167732364","https://openalex.org/W2228647872","https://openalex.org/W3124966411"],"related_works":["https://openalex.org/W4285277090","https://openalex.org/W2015060724","https://openalex.org/W2187391117","https://openalex.org/W1996226968","https://openalex.org/W2393350255","https://openalex.org/W257189624","https://openalex.org/W2356369451","https://openalex.org/W4390176194","https://openalex.org/W4385382439","https://openalex.org/W4297903463"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"big":[2],"data":[3],"applications,":[4],"first-order":[5,30],"methods":[6,17,37,261,285],"have":[7],"been":[8,25],"extremely":[9],"popular":[10],"in":[11,216],"recent":[12],"years.":[13],"However,":[14],"naive":[15],"gradient":[16],"generally":[18],"converge":[19],"slowly.":[20],"Hence,":[21],"much":[22],"effort":[23],"has":[24],"made":[26],"to":[27,79,86,124,154,178,185,239,264],"accelerate":[28],"various":[29],"methods.":[31,271],"This":[32,208],"paper":[33],"proposes":[34],"two":[35],"accelerated":[36,70,123,144,260,270],"towards":[38],"solving":[39],"structured":[40],"linearly":[41],"constrained":[42],"convex":[43,50],"programming,":[44,251],"for":[45],"which":[46,228],"we":[47,104,197],"assume":[48],"composite":[49,156],"objective":[51,180,241],"that":[52,106,199,215],"is":[53,68,133,142,210],"the":[54,69,80,87,92,118,127,134,143,155,164,179,187,240,275,283],"sum":[55],"of":[56,136,149,172,277,282],"a":[57,61,211],"differentiable":[58,88],"function":[59,89],"and":[60,90,95,120,181,236,254,267,279],"possibly":[62],"nondifferentiable":[63],"one.":[64],"The":[65,139,258,272],"first":[66],"method":[67,74,141,148,171,175],"linearized":[71,145],"augmented":[72,93,183,243],"Lagrangian":[73],"(LALM).":[75],"At":[76],"each":[77],"update":[78,188],"primal":[81],"variable,":[82,196],"it":[83,97,158],"allows":[84,176],"linearization":[85,177,238],"also":[91,182,201,268],"term,":[94],"thus":[96],"enables":[98],"easy":[99],"subproblems.":[100],"Assuming":[101,190],"merely":[102],"convexity,":[103,157],"show":[105,198],"LALM":[107],"owns":[108],"$O(1/t)$":[109],"convergence":[110,204],"if":[111,126],"parameters":[112,128],"are":[113,129,247,262],"kept":[114],"fixed":[115],"during":[116],"all":[117],"iterations":[119],"can":[121],"be":[122],"$O(1/t^2)$":[125,203],"adapted,":[130],"where":[131],"$t$":[132],"number":[135],"total":[137],"iterations.":[138],"second":[140],"alternating":[146,169],"direction":[147,170],"multipliers":[150],"(LADMM).":[151],"In":[152],"addition":[153],"further":[159],"assumes":[160],"two-block":[161],"structure":[162],"on":[163,193,232,249],"objective.":[165],"Different":[166],"from":[167],"classic":[168],"multipliers,":[173],"our":[174],"term":[184],"make":[186],"simple.":[189],"strong":[191,230],"convexity":[192,231],"one":[194],"block":[195,234],"LADMM":[200],"enjoys":[202],"with":[205],"adaptive":[206],"parameters.":[207],"result":[209],"significant":[212],"improvement":[213],"over":[214,286],"[Goldstein":[217],"et.":[218],"al,":[219],"SIAM":[220],"J.":[221],"Imag.":[222],"Sci.,":[223],"7":[224],"(2014),":[225],"pp.":[226],"1588--1623],":[227],"requires":[229],"both":[233],"variables":[235],"no":[237],"or":[242],"term.":[244],"Numerical":[245],"experiments":[246],"performed":[248],"quadratic":[250],"image":[252],"denoising,":[253],"support":[255],"vector":[256],"machine.":[257],"proposed":[259,284],"compared":[263],"nonaccelerated":[265],"ones":[266],"existing":[269,287],"results":[273],"demonstrate":[274],"validity":[276],"acceleration":[278],"superior":[280],"performance":[281],"ones.":[288]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":7}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}