{"id":"https://openalex.org/W2783742282","doi":"https://doi.org/10.1109/allerton.2017.8262874","title":"Robust convergence analysis of distributed optimization algorithms","display_name":"Robust convergence analysis of distributed optimization algorithms","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2783742282","doi":"https://doi.org/10.1109/allerton.2017.8262874","mag":"2783742282"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2017.8262874","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2017.8262874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5100756533","display_name":"Akhil Sundararajan","orcid":"https://orcid.org/0000-0001-8824-6467"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Akhil Sundararajan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016980595","display_name":"Bin Hu","orcid":"https://orcid.org/0000-0002-8851-4561"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]},{"id":"https://openalex.org/I2802999273","display_name":"Wisconsin Institutes for Discovery","ror":"https://ror.org/05gbven85","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I2802999273"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bin Hu","raw_affiliation_strings":["Wisconsin Institute for Discovery, University of Wisconsin-Madison"],"affiliations":[{"raw_affiliation_string":"Wisconsin Institute for Discovery, University of Wisconsin-Madison","institution_ids":["https://openalex.org/I2802999273","https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016674253","display_name":"Laurent Lessard","orcid":"https://orcid.org/0000-0001-5389-9361"},"institutions":[{"id":"https://openalex.org/I2802999273","display_name":"Wisconsin Institutes for Discovery","ror":"https://ror.org/05gbven85","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I2802999273"]},{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laurent Lessard","raw_affiliation_strings":["Wisconsin Institute for Discovery, University of Wisconsin-Madison"],"affiliations":[{"raw_affiliation_string":"Wisconsin Institute for Discovery, University of Wisconsin-Madison","institution_ids":["https://openalex.org/I2802999273","https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100756533"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":4.9728,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.95935353,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1206","last_page":"1212"},"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.9997000098228455,"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.9997000098228455,"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.9943000078201294,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.991100013256073,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.632104754447937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5828810930252075},{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.5724202990531921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5472986698150635},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5152555108070374},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5052939057350159},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5014908313751221},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.4878852367401123},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4474600553512573},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41695359349250793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3389488458633423},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31220412254333496}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.632104754447937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5828810930252075},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.5724202990531921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5472986698150635},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5152555108070374},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5052939057350159},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5014908313751221},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.4878852367401123},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4474600553512573},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41695359349250793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3389488458633423},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31220412254333496},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2017.8262874","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2017.8262874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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":16,"referenced_works":["https://openalex.org/W330173850","https://openalex.org/W1481963315","https://openalex.org/W1568288633","https://openalex.org/W1571416372","https://openalex.org/W2044212084","https://openalex.org/W2074796812","https://openalex.org/W2097460613","https://openalex.org/W2124541940","https://openalex.org/W2132291180","https://openalex.org/W2141648331","https://openalex.org/W2158643468","https://openalex.org/W2162761269","https://openalex.org/W2609549560","https://openalex.org/W2763533254","https://openalex.org/W2964102336","https://openalex.org/W3100513551"],"related_works":["https://openalex.org/W4386850441","https://openalex.org/W2479311294","https://openalex.org/W2094020986","https://openalex.org/W2028973390","https://openalex.org/W4236832331","https://openalex.org/W12419204","https://openalex.org/W2340554994","https://openalex.org/W2484127681","https://openalex.org/W4377097986","https://openalex.org/W4389599611"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,15,98,138],"unified":[3],"framework":[4],"for":[5,113,141,147],"analyzing":[6],"the":[7,26,46,50,61,65,70,73,84,114,148],"convergence":[8],"of":[9,29,49,72,104,133,150],"distributed":[10],"optimization":[11],"algorithms":[12,115,152],"by":[13],"formulating":[14],"semidefinite":[16],"program":[17],"(SDP)":[18],"which":[19],"can":[20],"be":[21],"efficiently":[22],"solved":[23],"to":[24],"bound":[25],"linear":[27],"rate":[28],"convergence.":[30],"Two":[31],"different":[32],"SDP":[33,41,66,79,100],"formulations":[34],"are":[35,125],"considered.":[36],"First,":[37],"we":[38,76,116],"formulate":[39,77],"an":[40,78],"that":[42,57,80,101,122],"depends":[43,81],"explicitly":[44,59],"on":[45,60,83],"gossip":[47,85],"matrix":[48,86],"network":[51],"graph.":[52,74],"This":[53,91],"result":[54,92],"provides":[55,93],"bounds":[56,112,124],"depend":[58],"graph":[62,105],"topology,":[63],"but":[64,96],"dimension":[67],"scales":[68],"with":[69],"size":[71],"Second,":[75],"implicitly":[82],"via":[87],"its":[88],"spectral":[89],"gap.":[90],"coarser":[94],"bounds,":[95],"yields":[97],"small":[99],"is":[102],"independent":[103],"size.":[106],"Our":[107],"approach":[108],"improves":[109],"upon":[110],"existing":[111],"analyzed,":[117],"and":[118,130,144,146],"numerical":[119],"simulations":[120],"reveal":[121],"our":[123,134],"likely":[126],"tight.":[127],"The":[128],"efficient":[129],"automated":[131],"nature":[132],"analysis":[135],"makes":[136],"it":[137],"powerful":[139],"tool":[140],"algorithm":[142],"selection":[143],"tuning,":[145],"discovery":[149],"new":[151],"as":[153],"well.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}