{"id":"https://openalex.org/W2030121914","doi":"https://doi.org/10.1137/120897547","title":"Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC","display_name":"Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2030121914","doi":"https://doi.org/10.1137/120897547","mag":"2030121914"},"language":"en","primary_location":{"id":"doi:10.1137/120897547","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120897547","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"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 Control and 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/A5029702671","display_name":"Valentin Nedelcu","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Valentin Nedelcu","raw_affiliation_strings":["University Politehnica of Bucharest,,,,,"],"affiliations":[{"raw_affiliation_string":"University Politehnica of Bucharest,,,,,","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["University Politehnica of Bucharest,,,,,"],"affiliations":[{"raw_affiliation_string":"University Politehnica of Bucharest,,,,,","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056282016","display_name":"Quoc Tran-Dinh","orcid":"https://orcid.org/0000-0002-1077-2579"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Quoc Tran-Dinh","raw_affiliation_strings":["Statistics and Operations Research"],"affiliations":[{"raw_affiliation_string":"Statistics and Operations Research","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029702671"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":17.0968016,"has_fulltext":false,"cited_by_count":110,"citation_normalized_percentile":{"value":0.99330466,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"52","issue":"5","first_page":"3109","last_page":"3134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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.9961000084877014,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.83191978931427},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.6998291015625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6845149397850037},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6300358176231384},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6284624338150024},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6044269800186157},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5447630882263184},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5389308333396912},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5054538249969482},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.49790167808532715},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4940932095050812},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4583946466445923},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.40300965309143066},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.34107673168182373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2594844698905945},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.11377212405204773},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06950196623802185}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.83191978931427},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.6998291015625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6845149397850037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6300358176231384},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6284624338150024},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6044269800186157},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5447630882263184},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5389308333396912},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5054538249969482},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.49790167808532715},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4940932095050812},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4583946466445923},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.40300965309143066},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.34107673168182373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2594844698905945},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.11377212405204773},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06950196623802185},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/120897547","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120897547","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"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 Control and Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1603657390","https://openalex.org/W1963529497","https://openalex.org/W1964522818","https://openalex.org/W1981832695","https://openalex.org/W2033121805","https://openalex.org/W2042613327","https://openalex.org/W2044494131","https://openalex.org/W2050014122","https://openalex.org/W2052782332","https://openalex.org/W2055364214","https://openalex.org/W2057624533","https://openalex.org/W2063430487","https://openalex.org/W2073819859","https://openalex.org/W2092235910","https://openalex.org/W2094333464","https://openalex.org/W2102737570","https://openalex.org/W2106821132","https://openalex.org/W2116773335","https://openalex.org/W2119273405","https://openalex.org/W2124768887","https://openalex.org/W2135779729","https://openalex.org/W2167732364","https://openalex.org/W3141507996"],"related_works":["https://openalex.org/W2360271985","https://openalex.org/W2131718214","https://openalex.org/W2002987466","https://openalex.org/W2070276483","https://openalex.org/W2167308866","https://openalex.org/W1972437117","https://openalex.org/W1635517180","https://openalex.org/W1973889396","https://openalex.org/W3207854495","https://openalex.org/W2015355851"],"abstract_inverted_index":{"We":[0,20,74,105,143],"study":[1],"the":[2,22,30,49,53,78,81,85,109,120,131,135,149],"computational":[3],"complexity":[4],"certification":[5],"of":[6,32,52,84,119,134,148,158],"inexact":[7,43,140],"gradient":[8,36,39,100,103],"augmented":[9,23,54],"Lagrangian":[10,24,55],"methods":[11,40],"for":[12,98],"solving":[13],"convex":[14],"optimization":[15],"problems":[16,89,157],"with":[17,35],"complicated":[18],"constraints.":[19],"solve":[21,65],"dual":[25,88,112,125,136,141],"problem":[26,57,67],"that":[27],"arises":[28],"from":[29],"relaxation":[31],"complicating":[33],"constraints":[34],"and":[37,80,87,90,101,111,114,124,138],"fast":[38,102],"based":[41],"on":[42,108,115,130,139,152],"first":[44],"order":[45],"information.":[46],"Moreover,":[47],"since":[48],"exact":[50],"solution":[51],"primal":[56,86,110,116,123],"is":[58],"hard":[59],"to":[60,69],"compute":[61],"in":[62],"practice,":[63],"we":[64,91],"this":[66],"up":[68],"some":[70],"given":[71],"inner":[72,79],"accuracy.":[73],"derive":[75],"relations":[76],"between":[77],"outer":[82],"accuracy":[83],"give":[92],"a":[93],"full":[94],"convergence":[95],"rate":[96],"analysis":[97,128],"both":[99],"algorithms.":[104],"provide":[106],"estimates":[107],"suboptimality":[113],"feasibility":[117],"violation":[118],"generated":[121],"approximate":[122],"solutions.":[126],"Our":[127],"relies":[129],"Lipschitz":[132],"property":[133],"function":[137],"gradients.":[142],"also":[144],"discuss":[145],"implementation":[146],"aspects":[147],"proposed":[150],"algorithms":[151],"constrained":[153],"model":[154],"predictive":[155],"control":[156],"embedded":[159],"linear":[160],"systems.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}