{"id":"https://openalex.org/W2562862721","doi":"https://doi.org/10.1109/tac.2011.2160020","title":"Gossip Algorithms for Convex Consensus Optimization Over Networks","display_name":"Gossip Algorithms for Convex Consensus Optimization Over Networks","publication_year":2011,"publication_date":"2011-06-21","ids":{"openalex":"https://openalex.org/W2562862721","doi":"https://doi.org/10.1109/tac.2011.2160020","mag":"2562862721"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2011.2160020","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2011.2160020","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/A5100675573","display_name":"Jie Lu","orcid":"https://orcid.org/0000-0002-4362-6543"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie Lu","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Oklahoma, Norman, OK, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahoma, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101932271","display_name":"Choon Yik Tang","orcid":"https://orcid.org/0000-0001-6145-301X"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Choon Yik Tang","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Oklahoma, Norman, OK, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahoma, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000299007","display_name":"Paul R. Regier","orcid":null},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul R. Regier","raw_affiliation_strings":["School of Electrical and Computer Engineering, University of Oklahoma, Norman, OK, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, University of Oklahoma, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026154794","display_name":"Travis D. Bow","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Travis D. Bow","raw_affiliation_strings":["Department of Mechanical Engineering, Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.4337,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.98863441,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"56","issue":"12","first_page":"2917","last_page":"2923"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":1.0,"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":1.0,"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.9977999925613403,"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/T10482","display_name":"Mathematical and Theoretical Epidemiology and Ecology Models","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/2739","display_name":"Public Health, Environmental and Occupational Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.8509259223937988},{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.7009282112121582},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6520518660545349},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6220197081565857},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5835174322128296},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5438776612281799},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49209874868392944},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4872552454471588},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.45642587542533875},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.43849048018455505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4237050712108612},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.41770100593566895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37098753452301025},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3395461440086365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09125667810440063}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8509259223937988},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.7009282112121582},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6520518660545349},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6220197081565857},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5835174322128296},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5438776612281799},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49209874868392944},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4872552454471588},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.45642587542533875},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.43849048018455505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4237050712108612},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.41770100593566895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37098753452301025},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3395461440086365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09125667810440063},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2011.2160020","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2011.2160020","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":[{"id":"https://openalex.org/G3905830469","display_name":null,"funder_award_id":"CMMI-0900806","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3966107474","display_name":"REU Site: Sensors and Metrology for Manufacturing and Newer Enterprises","funder_award_id":"0755011","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7254638361","display_name":"Control-Theoretic Approaches to Communication-Efficient, Distributed Convex Optimization over Wireless Networks","funder_award_id":"0900806","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1506295250","https://openalex.org/W1547358136","https://openalex.org/W1556217901","https://openalex.org/W1568668329","https://openalex.org/W1831334231","https://openalex.org/W1973754217","https://openalex.org/W2044212084","https://openalex.org/W2054104996","https://openalex.org/W2066332749","https://openalex.org/W2076428552","https://openalex.org/W2107664305","https://openalex.org/W2117412539","https://openalex.org/W2117905067","https://openalex.org/W2128927076","https://openalex.org/W2141788746","https://openalex.org/W2142184324","https://openalex.org/W2150633835","https://openalex.org/W2160643434","https://openalex.org/W2160785244","https://openalex.org/W2542402085","https://openalex.org/W2562862721","https://openalex.org/W2963957353","https://openalex.org/W6638666443","https://openalex.org/W6663928985","https://openalex.org/W6729235489"],"related_works":["https://openalex.org/W4386850441","https://openalex.org/W2465405765","https://openalex.org/W4297153560","https://openalex.org/W2964186284","https://openalex.org/W2804400349","https://openalex.org/W4301054389","https://openalex.org/W2393350255","https://openalex.org/W257189624","https://openalex.org/W2356369451","https://openalex.org/W4297903463"],"abstract_inverted_index":{"In":[0],"many":[1],"applications,":[2],"nodes":[3,149],"in":[4],"a":[5,10,18,46,96,123,144],"network":[6],"desire":[7],"not":[8],"only":[9],"consensus,":[11],"but":[12],"an":[13],"optimal":[14],"one.":[15],"To":[16],"date,":[17],"family":[19],"of":[20,110,146],"subgradient":[21,112],"algorithms":[22,51,70],"have":[23],"been":[24],"proposed":[25],"to":[26,106,150],"solve":[27,72],"this":[28],"problem":[29],"under":[30],"general":[31],"convexity":[32],"assumptions.":[33],"This":[34],"technical":[35],"note":[36],"shows":[37],"that,":[38],"for":[39],"the":[40,111,133],"scalar":[41],"case":[42],"and":[43,64,94,102,114,127,137],"by":[44],"assuming":[45],"bit":[47],"more,":[48],"novel":[49],"non-gradient-based":[50],"with":[52,82],"appealing":[53],"features":[54],"can":[55],"be":[56],"constructed.":[57],"Specifically,":[58],"we":[59],"develop":[60],"Pairwise":[61,65,135],"Equalizing":[62],"(PE)":[63],"Bisectioning":[66],"(PB),":[67],"two":[68],"gossip":[69],"that":[71,100,121],"unconstrained,":[73],"separable,":[74],"convex":[75],"consensus":[76],"optimization":[77],"problems":[78],"over":[79],"undirected":[80],"networks":[81],"time-varying":[83],"topologies,":[84],"where":[85],"each":[86],"local":[87,154],"function":[88,126],"is":[89],"strictly":[90],"convex,":[91],"continuously":[92],"differentiable,":[93],"has":[95],"minimizer.":[97],"We":[98],"show":[99],"PE":[101,131],"PB":[103,142],"are":[104],"easy":[105],"implement,":[107],"bypass":[108],"limitations":[109],"algorithms,":[113],"produce":[115],"switched,":[116],"nonlinear,":[117],"networked":[118],"dynamical":[119],"systems":[120],"admit":[122],"common":[124],"Lyapunov":[125],"asymptotically":[128],"converge.":[129],"Moreover,":[130],"generalizes":[132],"well-known":[134],"Averaging":[136],"Randomized":[138],"Gossip":[139],"Algorithm,":[140],"while":[141],"relaxes":[143],"requirement":[145],"PE,":[147],"allowing":[148],"never":[151],"share":[152],"their":[153],"functions.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":10}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}