{"id":"https://openalex.org/W1972717324","doi":"https://doi.org/10.1109/ascc.2013.6606286","title":"Feasible distributed MPC scheme for network systems based on an inexact dual gradient method","display_name":"Feasible distributed MPC scheme for network systems based on an inexact dual gradient method","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1972717324","doi":"https://doi.org/10.1109/ascc.2013.6606286","mag":"1972717324"},"language":"en","primary_location":{"id":"doi:10.1109/ascc.2013.6606286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ascc.2013.6606286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 9th Asian Control Conference (ASCC)","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/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":true,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica of Bucharest, Bucharest, Romania","Autom. Control & Syst. Eng. Dept., Univ. Politeh. of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Autom. Control & Syst. Eng. Dept., Univ. Politeh. of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","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":false,"raw_author_name":"Valentin Nedelcu","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica of Bucharest, Bucharest, Romania","Autom. Control & Syst. Eng. Dept., Univ. Politeh. of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Autom. Control & Syst. Eng. Dept., Univ. Politeh. of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028772568","display_name":"Dragos Clipici","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":false,"raw_author_name":"Dragos Clipici","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica of Bucharest, Bucharest, Romania","Autom. Control & Syst. Eng. Dept., Univ. Politeh. of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Autom. Control & Syst. Eng. Dept., Univ. Politeh. of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019114471"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05637852,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9987000226974487,"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.9987000226974487,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9861000180244446,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.7682160139083862},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6902418732643127},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6719468832015991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6376880407333374},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6172501444816589},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5632843375205994},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5493197441101074},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5177432894706726},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5170236825942993},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.503290593624115},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.4896319508552551},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4355873167514801},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42721307277679443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3009800910949707},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.1981499195098877},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.09793269634246826},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08505484461784363}],"concepts":[{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.7682160139083862},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6902418732643127},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6719468832015991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6376880407333374},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6172501444816589},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5632843375205994},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5493197441101074},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5177432894706726},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5170236825942993},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.503290593624115},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.4896319508552551},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4355873167514801},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42721307277679443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3009800910949707},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.1981499195098877},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.09793269634246826},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08505484461784363},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ascc.2013.6606286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ascc.2013.6606286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 9th Asian Control Conference (ASCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1603765807","https://openalex.org/W1609512298","https://openalex.org/W1627598360","https://openalex.org/W1963529497","https://openalex.org/W1964375219","https://openalex.org/W1995286048","https://openalex.org/W2014962119","https://openalex.org/W2032606187","https://openalex.org/W2088171372","https://openalex.org/W2090117039","https://openalex.org/W2095984592","https://openalex.org/W2102737570","https://openalex.org/W2106821132","https://openalex.org/W2124541940","https://openalex.org/W2126194904","https://openalex.org/W2144132844","https://openalex.org/W2149192560","https://openalex.org/W2167732364","https://openalex.org/W2963183767","https://openalex.org/W3122321968"],"related_works":["https://openalex.org/W2140057251","https://openalex.org/W263682811","https://openalex.org/W2564172750","https://openalex.org/W2846499288","https://openalex.org/W3197592642","https://openalex.org/W3199158697","https://openalex.org/W2356977358","https://openalex.org/W2302465375","https://openalex.org/W2098528027","https://openalex.org/W2088605360"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,21],"propose":[4],"an":[5],"inexact":[6],"dual":[7,27],"gradient":[8],"method":[9,44,52],"for":[10,62],"solving":[11],"large-scale":[12],"smooth":[13],"convex":[14],"optimization":[15],"problems.":[16],"For":[17],"the":[18,34],"proposed":[19],"algorithm":[20],"provide":[22],"estimates":[23],"on":[24],"primal":[25,30],"and":[26,29,56],"suboptimality":[28],"infeasibility.":[31],"We":[32,49],"solve":[33],"inner":[35],"problems":[36],"by":[37],"means":[38],"of":[39],"a":[40,58],"parallel":[41],"coordinate":[42],"descent":[43],"with":[45],"linear":[46],"convergence":[47],"rate.":[48],"adapt":[50],"our":[51],"using":[53],"constraint":[54],"tightening":[55],"obtain":[57],"distributed":[59],"MPC":[60],"strategy":[61],"network":[63],"systems":[64],"which":[65],"guarantees":[66],"feasibility.":[67]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}