{"id":"https://openalex.org/W2002745466","doi":"https://doi.org/10.1109/tac.2013.2250071","title":"Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks","display_name":"Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks","publication_year":2013,"publication_date":"2013-07-19","ids":{"openalex":"https://openalex.org/W2002745466","doi":"https://doi.org/10.1109/tac.2013.2250071","mag":"2002745466"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2013.2250071","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2013.2250071","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/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":["Department of Automatic Control and Systems Engineering, University Politehnica of Bucharest, Bucharest, Romania","[Department of Automatic Control and Systems Engineering, University Politehnica Bucharest, Bucharest, Romania]"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control and Systems Engineering, University Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"[Department of Automatic Control and Systems Engineering, University Politehnica Bucharest, Bucharest, Romania]","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019114471"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":12.4386,"has_fulltext":false,"cited_by_count":117,"citation_normalized_percentile":{"value":0.99150149,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"58","issue":"8","first_page":"2001","last_page":"2012"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9987999796867371,"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.9984999895095825,"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.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.706083357334137},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.6383528113365173},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5502453446388245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5486050248146057},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.510618269443512},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.507719874382019},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5060927271842957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47861355543136597},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.4776443541049957},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.47623732686042786},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3972732722759247},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38594359159469604},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.33218914270401},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.10477051138877869},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10068893432617188}],"concepts":[{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.706083357334137},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.6383528113365173},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5502453446388245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5486050248146057},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.510618269443512},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.507719874382019},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5060927271842957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47861355543136597},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.4776443541049957},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.47623732686042786},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3972732722759247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38594359159469604},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33218914270401},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.10477051138877869},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10068893432617188},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2013.2250071","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2013.2250071","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W204185347","https://openalex.org/W1966881087","https://openalex.org/W1982941867","https://openalex.org/W2002482313","https://openalex.org/W2003492573","https://openalex.org/W2028870622","https://openalex.org/W2039050532","https://openalex.org/W2060777387","https://openalex.org/W2067484689","https://openalex.org/W2072265605","https://openalex.org/W2089884390","https://openalex.org/W2095984592","https://openalex.org/W2104842473","https://openalex.org/W2104891202","https://openalex.org/W2114085163","https://openalex.org/W2116940697","https://openalex.org/W2117575248","https://openalex.org/W2117686388","https://openalex.org/W2124541940","https://openalex.org/W2128529555","https://openalex.org/W2726938673","https://openalex.org/W2752908210","https://openalex.org/W2787198218","https://openalex.org/W4238591275","https://openalex.org/W4254313632","https://openalex.org/W4255680218","https://openalex.org/W6740552509"],"related_works":["https://openalex.org/W2895097035","https://openalex.org/W4206903459","https://openalex.org/W2754816816","https://openalex.org/W4286693783","https://openalex.org/W3175914740","https://openalex.org/W4366280654","https://openalex.org/W3160167280","https://openalex.org/W4362706668","https://openalex.org/W4231621013","https://openalex.org/W3034587794"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,123],"develop":[4],"randomized":[5,114],"block-coordinate":[6],"descent":[7,161],"methods":[8,77,190],"for":[9,131],"minimizing":[10],"multi-agent":[11],"convex":[12,142],"optimization":[13,180],"problems":[14,165,181],"with":[15,166],"linearly":[16,169],"coupled":[17,170],"constraints":[18],"over":[19],"networks":[20],"and":[21,64,92,122,163],"prove":[22],"that":[23,56,176],"they":[24],"obtain":[25],"in":[26,32,59,98,135],"expectation":[27],"an":[28],"\u03b5":[29],"accurate":[30],"solution":[31],"at":[33,125],"most":[34],"O(1/\u03bb":[35],"<sub":[36,43],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[37,44],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[38,45],"(Q)\u03f5)":[39],"iterations,":[40],"where":[41],"\u03bb":[42],"(Q)":[46],"is":[47,57,78,137,184],"the":[48,62,65,70,82,109,152],"second":[49],"smallest":[50],"eigenvalue":[51],"of":[52,61,67,75,84,133],"a":[53,85,99,127,156],"matrix":[54],"Q":[55],"defined":[58],"terms":[60],"probabilities":[63,110],"number":[66],"blocks.":[68],"However,":[69],"computational":[71],"complexity":[72],"per":[73],"iteration":[74,94],"our":[76,144,182],"much":[79,185],"simpler":[80],"than":[81,189],"one":[83],"method":[86,162,183],"based":[87,191],"on":[88,105,177,192],"full":[89,193],"gradient":[90],"information":[91],"each":[93],"can":[95],"be":[96],"computed":[97],"completely":[100],"distributed":[101,145],"way.":[102],"We":[103,149],"focus":[104],"how":[106],"to":[107,111,116,155,164],"choose":[108],"make":[112],"these":[113],"algorithms":[115,146],"converge":[117,147],"as":[118,120],"fast":[119],"possible":[121],"arrive":[124],"solving":[126],"sparse":[128],"SDP.":[129],"Analysis":[130],"rate":[132],"convergence":[134],"probability":[136],"also":[138,150],"provided.":[139],"For":[140],"strongly":[141],"functions":[143],"linearly.":[148],"extend":[151],"main":[153],"algorithm":[154],"more":[157,167,186],"general":[158,168],"random":[159],"coordinate":[160],"constraints.":[171],"Preliminary":[172],"numerical":[173],"tests":[174],"confirm":[175],"very":[178],"large":[179],"numerically":[187],"efficient":[188],"gradient.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}