{"id":"https://openalex.org/W2079797805","doi":"https://doi.org/10.1109/cdc.2012.6426313","title":"Iteration complexity of an inexact augmented Lagrangian method for constrained MPC","display_name":"Iteration complexity of an inexact augmented Lagrangian method for constrained MPC","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2079797805","doi":"https://doi.org/10.1109/cdc.2012.6426313","mag":"2079797805"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2012.6426313","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-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/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"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":["Automation and Systems Engineering Department, Polytechnic University of Bucharest, Bucharest, Romania","Automation and Systems Engineering Department, University Politehnica Bucharest, 060042, Romania"],"affiliations":[{"raw_affiliation_string":"Automation and Systems Engineering Department, Polytechnic University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442","https://openalex.org/I61641377"]},{"raw_affiliation_string":"Automation and Systems Engineering Department, University Politehnica Bucharest, 060042, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"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":["Automation and Systems Engineering Department, Polytechnic University of Bucharest, Bucharest, Romania","Automation and Systems Engineering Department, University Politehnica Bucharest, 060042, Romania"],"affiliations":[{"raw_affiliation_string":"Automation and Systems Engineering Department, Polytechnic University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442","https://openalex.org/I61641377"]},{"raw_affiliation_string":"Automation and Systems Engineering Department, University Politehnica Bucharest, 060042, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029702671"],"corresponding_institution_ids":["https://openalex.org/I141595442","https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":3.9413,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.9365342,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"650","last_page":"655"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9970999956130981,"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.9970999956130981,"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.9932000041007996,"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.9853000044822693,"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.8026365041732788},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.7331920862197876},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6686776876449585},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6375851631164551},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5664089918136597},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.5221995711326599},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.494524210691452},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4803691804409027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46036186814308167},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.44278663396835327},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.43674543499946594}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.8026365041732788},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7331920862197876},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6686776876449585},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6375851631164551},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5664089918136597},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.5221995711326599},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.494524210691452},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4803691804409027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46036186814308167},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.44278663396835327},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.43674543499946594},{"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2012.6426313","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1978956894","https://openalex.org/W2006352352","https://openalex.org/W2010566422","https://openalex.org/W2019495552","https://openalex.org/W2043724067","https://openalex.org/W2044494131","https://openalex.org/W2044774602","https://openalex.org/W2057624533","https://openalex.org/W2090117039","https://openalex.org/W2106821132","https://openalex.org/W2118917046","https://openalex.org/W2124541940","https://openalex.org/W2124768887","https://openalex.org/W2135779729","https://openalex.org/W2167732364","https://openalex.org/W3122321968","https://openalex.org/W4244633107","https://openalex.org/W6661561349","https://openalex.org/W6678644695"],"related_works":["https://openalex.org/W2015060724","https://openalex.org/W2002102264","https://openalex.org/W4237964977","https://openalex.org/W2058578573","https://openalex.org/W2360271985","https://openalex.org/W1996993548","https://openalex.org/W2012871340","https://openalex.org/W3046535663","https://openalex.org/W2131718214","https://openalex.org/W3207854495"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,65,93,110],"discuss":[4,76],"the":[5,25,35,40,43,48,52,71,77,80,83,87,120,132],"iteration":[6],"complexity":[7],"certification":[8],"for":[9,14],"solving":[10],"constrained":[11],"MPC":[12],"problems":[13,134],"linear":[15,36],"systems":[16],"using":[17],"an":[18,67,113],"inexact":[19,68],"augmented":[20,26,54],"Lagrangian":[21],"approach.":[22],"We":[23,75,107],"solve":[24],"dual":[27,44,72,90,101],"problem":[28,56,91],"that":[29,109,131],"arises":[30],"from":[31,39],"Lagrange":[32,55],"relaxation":[33],"of":[34,51,70,86,119],"constraints":[37],"coming":[38],"dynamics":[41],"with":[42,137],"gradient":[45,73],"method.":[46,74],"Since":[47],"exact":[49],"solution":[50,116],"primal":[53,88,99,105,121],"is":[57],"usually":[58],"impossible":[59],"to":[60],"compute":[61],"in":[62,117,125],"practical":[63],"situations,":[64],"consider":[66],"version":[69],"relation":[78],"between":[79],"inner":[81,133],"and":[82,89,92,100,123],"outer":[84],"accuracy":[85,138],"derive":[94],"lower":[95],"bounds":[96],"on":[97],"both":[98],"gap":[102],"but":[103],"also":[104],"feasibility.":[106],"prove":[108],"can":[111],"obtain":[112],"o":[114],"accurate":[115],"terms":[118],"optimality":[122],"feasibility":[124],"at":[126],"most":[127],"O(1/\u03f5)":[128],"iterations,":[129],"provided":[130],"are":[135],"solved":[136],"\u03b5":[139],"<sup":[140],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[141],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[142],".":[143]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}