{"id":"https://openalex.org/W2168736040","doi":"https://doi.org/10.1109/cdc.2010.5717991","title":"Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization","display_name":"Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2168736040","doi":"https://doi.org/10.1109/cdc.2010.5717991","mag":"2168736040"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2010.5717991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2010.5717991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"49th 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/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":["Automation and Systems Engineering Department, Politehnica University of Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automation and Systems Engineering Department, Politehnica University of Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113492166","display_name":"Ioan Dumitrache","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":"Ioan Dumitrache","raw_affiliation_strings":["Automation and Systems Engineering Department, Politehnica University of Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automation and Systems Engineering Department, Politehnica University of Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078854904","display_name":"Johan A. K. Suykens","orcid":"https://orcid.org/0000-0002-8846-6352"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Johan A.K. Suykens","raw_affiliation_strings":["Electrical Engineering Department (ESAT-SCD), Katholieke Universiteit Leuven, Belgium"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department (ESAT-SCD), Katholieke Universiteit Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"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.3561,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.66756291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"28","issue":null,"first_page":"1366","last_page":"1371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9998999834060669,"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/T11347","display_name":"Neural Networks Stability and Synchronization","score":0.9790999889373779,"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/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9415000081062317,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/subgradient-method","display_name":"Subgradient method","score":0.9394458532333374},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6780195236206055},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5101516842842102},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.50861656665802},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4839670956134796},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4425748586654663},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4319005310535431},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4261448085308075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4226440191268921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32470571994781494},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.32029205560684204}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9394458532333374},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6780195236206055},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5101516842842102},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.50861656665802},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4839670956134796},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4425748586654663},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4319005310535431},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4261448085308075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4226440191268921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32470571994781494},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.32029205560684204},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2010.5717991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2010.5717991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"49th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1519983590","https://openalex.org/W1603765807","https://openalex.org/W2010015872","https://openalex.org/W2044212084","https://openalex.org/W2053764342","https://openalex.org/W2074796812","https://openalex.org/W2106821132","https://openalex.org/W2114791779","https://openalex.org/W2124541940","https://openalex.org/W2124620758","https://openalex.org/W2142184324","https://openalex.org/W2160643434","https://openalex.org/W2475559389","https://openalex.org/W3141595720","https://openalex.org/W4249667877","https://openalex.org/W6631077220","https://openalex.org/W6676812660","https://openalex.org/W6720815106"],"related_works":["https://openalex.org/W2359120930","https://openalex.org/W1991078291","https://openalex.org/W4238880966","https://openalex.org/W2140018151","https://openalex.org/W3084689723","https://openalex.org/W3161275408","https://openalex.org/W2811183536","https://openalex.org/W3088056528","https://openalex.org/W2000285254","https://openalex.org/W3153752017"],"abstract_inverted_index":{"In":[0],"this":[1,40,60],"paper":[2],"we":[3,34,52],"study":[4],"the":[5,10,18,74,101,107,111,116,140,152,160],"constrained":[6,26],"consensus":[7,83,117,158],"problem,":[8],"i.e.":[9],"problem":[11,41,46],"of":[12,39,62,151],"reaching":[13],"a":[14,36,43,54,68],"common":[15],"point":[16],"from":[17,133],"estimates":[19],"generated":[20],"by":[21],"multiple":[22],"agents":[23],"that":[24,110,170],"are":[25,142],"to":[27,115,163],"lie":[28],"in":[29,67,92,94,137,149],"different":[30],"constraint":[31],"sets.":[32],"First,":[33],"provide":[35],"novel":[37],"formulation":[38],"as":[42,122],"convex":[44,64],"optimization":[45,65],"but":[47],"with":[48,96],"coupling":[49],"constraints.":[50],"Then,":[51],"propose":[53],"primal-dual":[55,102],"decomposition":[56],"method":[57],"for":[58,89,100,106],"solving":[59],"type":[61],"coupled":[63],"problems":[66],"distributed":[69,154],"fashion":[70],"given":[71],"restrictions":[72],"on":[73,82,157],"communication":[75],"topology.":[76],"The":[77],"proposed":[78],"algorithm":[79,139,172],"is":[80],"based":[81,156],"principles":[84,159],"(as":[85],"an":[86,174],"efficient":[87],"strategy":[88],"information":[90],"fusion":[91],"networks)":[93],"combination":[95],"local":[97],"subgradient":[98],"updates":[99],"variables.":[103],"We":[104],"show,":[105],"first":[108],"time,":[109],"nonnegative":[112],"weights":[113,141,161],"corresponding":[114],"process":[118],"can":[119,128],"be":[120,129,164],"interpreted":[121],"dual":[123],"variables":[124],"and":[125],"thus":[126],"they":[127],"updated":[130,143],"using":[131],"arguments":[132],"duality":[134],"theory.":[135],"Therefore,":[136],"our":[138,171],"following":[144],"some":[145,180],"precise":[146],"rules,":[147],"while":[148],"most":[150],"existing":[153,181],"algorithms":[155],"have":[162],"tuned.":[165],"Preliminary":[166],"simulation":[167],"results":[168],"show":[169],"works,":[173],"average,":[175],"ten":[176],"times":[177],"faster":[178],"than":[179],"methods.":[182]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}