{"id":"https://openalex.org/W2619881536","doi":"https://doi.org/10.1109/tac.2017.2747503","title":"Complexity Certification of a Distributed Augmented Lagrangian Method","display_name":"Complexity Certification of a Distributed Augmented Lagrangian Method","publication_year":2017,"publication_date":"2017-08-30","ids":{"openalex":"https://openalex.org/W2619881536","doi":"https://doi.org/10.1109/tac.2017.2747503","mag":"2619881536"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2017.2747503","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2747503","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5100734097","display_name":"Soomin Lee","orcid":"https://orcid.org/0000-0003-3959-6473"},"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":"Soomin Lee","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Georgia Tech, Atlanta, GA, USA"],"raw_orcid":"https://orcid.org/0000-0003-3959-6473","affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Georgia Tech, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086888501","display_name":"Nikolaos Chatzipanagiotis","orcid":"https://orcid.org/0000-0003-2326-5119"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikolaos Chatzipanagiotis","raw_affiliation_strings":["Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA"],"raw_orcid":"https://orcid.org/0000-0003-2326-5119","affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080808780","display_name":"Michael M. Zavlanos","orcid":"https://orcid.org/0000-0003-1748-8228"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael M. Zavlanos","raw_affiliation_strings":["Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA"],"raw_orcid":"https://orcid.org/0000-0003-1748-8228","affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Materials Science, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.595,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.8741451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"63","issue":"3","first_page":"827","last_page":"834"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9993000030517578,"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.9993000030517578,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9983000159263611,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9980000257492065,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6608748435974121},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.6486274003982544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5808942914009094},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5249319672584534},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5208183526992798},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5096256732940674},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5016326904296875},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.44709908962249756},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.43665724992752075},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4214813709259033},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41423434019088745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31031423807144165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2521311044692993},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.07048124074935913}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6608748435974121},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.6486274003982544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5808942914009094},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5249319672584534},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5208183526992798},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5096256732940674},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5016326904296875},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44709908962249756},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.43665724992752075},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4214813709259033},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41423434019088745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31031423807144165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2521311044692993},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.07048124074935913},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2017.2747503","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2017.2747503","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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":31,"referenced_works":["https://openalex.org/W1514810191","https://openalex.org/W1524324710","https://openalex.org/W1549918636","https://openalex.org/W1583497301","https://openalex.org/W1669104078","https://openalex.org/W1743692337","https://openalex.org/W1973615364","https://openalex.org/W1973889396","https://openalex.org/W1980145158","https://openalex.org/W1980236292","https://openalex.org/W1981832695","https://openalex.org/W1986080131","https://openalex.org/W1991482609","https://openalex.org/W2026342258","https://openalex.org/W2030121914","https://openalex.org/W2058532290","https://openalex.org/W2079261074","https://openalex.org/W2090117039","https://openalex.org/W2125390510","https://openalex.org/W2139596861","https://openalex.org/W2144603975","https://openalex.org/W2164278908","https://openalex.org/W2343466252","https://openalex.org/W2580975717","https://openalex.org/W2963000588","https://openalex.org/W3099831354","https://openalex.org/W4292363360","https://openalex.org/W6635018136","https://openalex.org/W6637911729","https://openalex.org/W6680827411","https://openalex.org/W6785381934"],"related_works":["https://openalex.org/W2593225479","https://openalex.org/W2754965690","https://openalex.org/W4303684645","https://openalex.org/W2089887069","https://openalex.org/W159360277","https://openalex.org/W3159039452","https://openalex.org/W4292651679","https://openalex.org/W2400034325","https://openalex.org/W2499557797","https://openalex.org/W2985014567"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,78,116],"present":[4],"complexity":[5,59,96],"certification":[6],"results":[7],"for":[8,84],"a":[9,44,80,118,121,127,138],"distributed":[10,32,45],"augmented":[11],"Lagrangian":[12],"(AL)":[13],"algorithm":[14],"used":[15],"to":[16,62,92,102,107],"solve":[17],"convex":[18],"optimization":[19],"problems":[20],"involving":[21,126],"globally":[22],"coupled":[23,40],"linear":[24,41],"constraints.":[25],"Our":[26],"method":[27],"relies":[28],"on":[29,48,111],"the":[30,39,52,57,85,104,109,112],"accelerated":[31],"AL":[33],"(ADAL)":[34],"algorithm,":[35],"which":[36,89,132],"can":[37],"handle":[38],"constraints":[42],"in":[43,68],"manner":[46],"based":[47],"local":[49],"estimates":[50],"of":[51,60,70,130],"AL.":[53],"We":[54,98],"show":[55,100],"that":[56],"theoretical":[58],"ADAL":[61],"reach":[63],"an":[64],"\u03b5-optimal":[65],"solution":[66],"both":[67],"terms":[69],"suboptimality":[71],"and":[72],"infeasibility":[73],"is":[74],"O(1/\u03b5)":[75],"iterations.":[76],"Moreover,":[77],"provide":[79],"valid":[81],"upper":[82],"bound":[83],"optimal":[86],"dual":[87],"multiplier,":[88],"enables":[90],"us":[91],"explicitly":[93],"specify":[94],"these":[95],"bounds.":[97],"also":[99],"how":[101],"choose":[103],"step-size":[105],"parameter":[106],"minimize":[108],"bounds":[110],"convergence":[113],"rates.":[114],"Finally,":[115],"discuss":[117],"motivating":[119],"example,":[120],"model":[122],"predictive":[123],"control":[124],"problem,":[125],"finite":[128],"number":[129],"subsystems,":[131],"interact":[133],"with":[134],"each":[135],"other":[136],"via":[137],"general":[139],"network.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}