{"id":"https://openalex.org/W2118285725","doi":"https://doi.org/10.1109/cdc.2008.4738764","title":"A proximal center-based decomposition method for multi-agent convex optimization","display_name":"A proximal center-based decomposition method for multi-agent convex optimization","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2118285725","doi":"https://doi.org/10.1109/cdc.2008.4738764","mag":"2118285725"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2008.4738764","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4738764","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","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/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Department of Electrical Engineering ESAT/SCD, Katholieke Universiteit Leuven, Leuven, Belgium","Dept. of Electr. Eng., Katholieke Univ. Leuven, Heverlee, Belgium"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering ESAT/SCD, Katholieke Universiteit Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Katholieke Univ. Leuven, Heverlee, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"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":["Department of Electrical Engineering ESAT/SCD, Katholieke Universiteit Leuven, Leuven, Belgium","Dept. of Electr. Eng., Katholieke Univ. Leuven, Heverlee, Belgium"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering ESAT/SCD, Katholieke Universiteit Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Katholieke Univ. Leuven, Heverlee, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019114471"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":2.5719,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.89353349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3077","last_page":"3082"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.996999979019165,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.996399998664856,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9958999752998352,"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/smoothing","display_name":"Smoothing","score":0.7258131504058838},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6945303678512573},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.6382541656494141},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6132944226264954},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5737488269805908},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5225995182991028},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5225653052330017},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.49765780568122864},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4874720573425293},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45555150508880615},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4441715478897095},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.42488032579421997},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41508129239082336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37510496377944946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.351984441280365}],"concepts":[{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.7258131504058838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6945303678512573},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.6382541656494141},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6132944226264954},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5737488269805908},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5225995182991028},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5225653052330017},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.49765780568122864},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4874720573425293},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45555150508880615},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4441715478897095},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.42488032579421997},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41508129239082336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37510496377944946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.351984441280365},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2008.4738764","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2008.4738764","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 47th IEEE Conference on Decision and Control","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":14,"referenced_works":["https://openalex.org/W1603765807","https://openalex.org/W1970986119","https://openalex.org/W1986364567","https://openalex.org/W2038888321","https://openalex.org/W2058532290","https://openalex.org/W2068000140","https://openalex.org/W2079261074","https://openalex.org/W2106821132","https://openalex.org/W2124541940","https://openalex.org/W2131869695","https://openalex.org/W2165275149","https://openalex.org/W2167732364","https://openalex.org/W2171305414","https://openalex.org/W3141595720"],"related_works":["https://openalex.org/W2074745806","https://openalex.org/W1997033546","https://openalex.org/W1600454385","https://openalex.org/W3120556963","https://openalex.org/W1979241556","https://openalex.org/W2105377028","https://openalex.org/W2312363448","https://openalex.org/W2187449906","https://openalex.org/W2962818859","https://openalex.org/W1543207628"],"abstract_inverted_index":{"In":[0,26],"this":[1,49],"paper":[2],"we":[3,29,51],"develop":[4],"a":[5,12,31,36,53,107],"new":[6,54,129],"dual":[7,80],"decomposition":[8,55],"method":[9,28,56,89,130],"for":[10,61,131],"optimizing":[11,93],"sum":[13,100],"of":[14,45,75,77,86,101,127],"convex":[15],"objective":[16,95,104],"functions":[17],"corresponding":[18,121],"to":[19,122],"multiple":[20],"agents":[21,114],"but":[22],"with":[23],"coupled":[24,124],"constraints.":[25,125],"our":[27],"define":[30],"smooth":[32],"Lagrangian,":[33],"by":[34,40,83],"using":[35],"smoothing":[37,108],"technique":[38],"developed":[39],"Nesterov,":[41],"which":[42,62,68],"preserves":[43],"separability":[44],"the":[46,70,73,78,99,111,118,123,128],"problem.":[47],"With":[48],"approach":[50],"propose":[52],"(the":[57],"proximal":[58],"center":[59],"method)":[60],"efficiency":[63],"estimates":[64],"are":[65,141],"derived":[66],"and":[67,106],"improves":[69],"bounds":[71],"on":[72],"number":[74],"iterations":[76],"classical":[79],"gradient":[81],"scheme":[82],"an":[84,94],"order":[85],"magnitude.":[87],"The":[88],"involves":[90],"every":[91],"agent":[92],"function":[96,105],"that":[97],"is":[98,115],"his":[102],"own":[103],"term":[109],"while":[110],"coordination":[112],"between":[113],"performed":[116],"via":[117],"Lagrange":[119],"multipliers":[120],"Applications":[126],"solving":[132],"distributed":[133],"model":[134],"predictive":[135],"control":[136],"or":[137],"network":[138],"optimization":[139],"problems":[140],"also":[142],"illustrated.":[143]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}