{"id":"https://openalex.org/W4387414975","doi":"https://doi.org/10.1109/tnse.2023.3321757","title":"<b>GradConsensus</b>: Linearly Convergent Algorithm for Reducing Disagreement in Multi-Agent Optimization","display_name":"<b>GradConsensus</b>: Linearly Convergent Algorithm for Reducing Disagreement in Multi-Agent Optimization","publication_year":2023,"publication_date":"2023-10-06","ids":{"openalex":"https://openalex.org/W4387414975","doi":"https://doi.org/10.1109/tnse.2023.3321757"},"language":"en","primary_location":{"id":"doi:10.1109/tnse.2023.3321757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnse.2023.3321757","pdf_url":null,"source":{"id":"https://openalex.org/S2484352698","display_name":"IEEE Transactions on Network Science and Engineering","issn_l":"2327-4697","issn":["2327-4697","2334-329X"],"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 Network Science and Engineering","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/A5001884655","display_name":"Vivek Khatana","orcid":"https://orcid.org/0000-0002-4111-3621"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vivek Khatana","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":"https://orcid.org/0000-0002-4111-3621","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030459370","display_name":"Govind Saraswat","orcid":"https://orcid.org/0000-0003-4591-0115"},"institutions":[{"id":"https://openalex.org/I4401726857","display_name":"Enphase Energy (United States)","ror":"https://ror.org/03mnkh157","country_code":null,"type":"company","lineage":["https://openalex.org/I4401726857"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Govind Saraswat","raw_affiliation_strings":["Enphase Energy, Austin, TX, USA"],"raw_orcid":"https://orcid.org/0000-0003-4591-0115","affiliations":[{"raw_affiliation_string":"Enphase Energy, Austin, TX, USA","institution_ids":["https://openalex.org/I4401726857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061458720","display_name":"Sourav Patel","orcid":"https://orcid.org/0000-0001-5820-5082"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sourav Patel","raw_affiliation_strings":["Google, Inc., Mountain View, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-5820-5082","affiliations":[{"raw_affiliation_string":"Google, Inc., Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069864205","display_name":"Murti V. Salapaka","orcid":"https://orcid.org/0000-0002-4595-9683"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Murti V. Salapaka","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":"https://orcid.org/0000-0002-4595-9683","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5001884655"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.9838,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77532474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"11","issue":"1","first_page":"1251","last_page":"1264"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9839000105857849,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9825000166893005,"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/convex-function","display_name":"Convex function","score":0.6667390465736389},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6132922172546387},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.5605409145355225},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5498908162117004},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5294800996780396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5013697147369385},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47001174092292786},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4524853825569153},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44559669494628906},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4314422011375427},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4310249090194702},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4272158443927765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42199745774269104},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.33444273471832275},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.2611137628555298},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10201069712638855}],"concepts":[{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6667390465736389},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6132922172546387},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.5605409145355225},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5498908162117004},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5294800996780396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5013697147369385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47001174092292786},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4524853825569153},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44559669494628906},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4314422011375427},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4310249090194702},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4272158443927765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42199745774269104},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.33444273471832275},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2611137628555298},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10201069712638855},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnse.2023.3321757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnse.2023.3321757","pdf_url":null,"source":{"id":"https://openalex.org/S2484352698","display_name":"IEEE Transactions on Network Science and Engineering","issn_l":"2327-4697","issn":["2327-4697","2334-329X"],"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 Network Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1565438868","https://openalex.org/W1571416372","https://openalex.org/W1603765807","https://openalex.org/W1616857247","https://openalex.org/W1627780903","https://openalex.org/W1665876831","https://openalex.org/W2032049676","https://openalex.org/W2044212084","https://openalex.org/W2063403497","https://openalex.org/W2106901427","https://openalex.org/W2110100895","https://openalex.org/W2124541940","https://openalex.org/W2129122308","https://openalex.org/W2137435346","https://openalex.org/W2142184324","https://openalex.org/W2148087609","https://openalex.org/W2172813797","https://openalex.org/W2325440561","https://openalex.org/W2592219848","https://openalex.org/W2609549560","https://openalex.org/W2617089797","https://openalex.org/W2737628516","https://openalex.org/W2749348574","https://openalex.org/W2771477296","https://openalex.org/W2792751837","https://openalex.org/W2912951471","https://openalex.org/W2945224315","https://openalex.org/W2962970367","https://openalex.org/W2963156126","https://openalex.org/W3006548771","https://openalex.org/W3045708356","https://openalex.org/W3099715789","https://openalex.org/W3102661755","https://openalex.org/W3143219376","https://openalex.org/W3155778088","https://openalex.org/W3201625863","https://openalex.org/W4250739957","https://openalex.org/W4309296688","https://openalex.org/W6658811187","https://openalex.org/W6734024365","https://openalex.org/W6740154879"],"related_works":["https://openalex.org/W4286857066","https://openalex.org/W1677518548","https://openalex.org/W3213958552","https://openalex.org/W4238239967","https://openalex.org/W4297812081","https://openalex.org/W2949926331","https://openalex.org/W2754545762","https://openalex.org/W4299562540","https://openalex.org/W4298208753","https://openalex.org/W3175273680"],"abstract_inverted_index":{"In":[0,93],"this":[1],"article,":[2],"we":[3,228],"propose":[4],"a":[5,15,21,38,84,107,120,149,156,205,239],"new":[6],"approach,":[7],"<italic":[8,47,73],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[9,48,74,207,215],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">optimize":[10,49],"then":[11,26,50],"agree</i>":[12,51],"for":[13,46,187,196],"minimizing":[14],"sum":[16],"of":[17,65,124,143,158,200,219,223,233],"convex":[18,132,144,191],"functions,":[19,148],"over":[20],"directed":[22],"graph.":[23],"The":[24,43,193],"optimize":[25],"agree":[27],"approach":[28],"decouples":[29],"the":[30,34,56,59,66,94,115,127,140,159,166,171,180,213,220,224,231,234],"optimization":[31,41,68],"step":[32,36],"and":[33,133,145],"consensus":[35,110,174],"in":[37,89,179,237],"multi-agent":[39],"distributed":[40,67,240],"framework.":[42],"key":[44],"motivation":[45],"is":[52,87,130,152,203],"to":[53,112],"guarantee":[54,85],"that":[55,138,161],"disagreement":[57],"between":[58],"agents'":[60],"estimates":[61],"at":[62],"every":[63],"iteration":[64,218],"algorithm":[69,202,236],"remains":[70],"under":[71,139],"any":[72],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">apriori</i>":[75],"specified":[76,169],"tolerance;":[77],"existing":[78,177],"algorithms":[79],"do":[80],"not":[81,188],"provide":[82],"such":[83,183],"which":[86],"required":[88],"many":[90],"practical":[91],"scenarios.":[92],"proposed":[95,235],"algorithm,":[96],"each":[97],"agent":[98],"utilizes":[99],"its":[100],"locally":[101],"available":[102],"function":[103,129],"information":[104],"along":[105],"with":[106],"finite-time":[108,172],"approximate":[109,173],"protocol":[111],"move":[113],"toward":[114],"optimal":[116],"solution.":[117],"We":[118,136],"establish":[119],"global":[121],"R-linear":[122],"rate":[123,151],"convergence":[125,185],"if":[126],"aggregate":[128],"strongly":[131,190],"Lipschitz":[134,146],"differentiable.":[135],"show":[137],"relaxed":[141],"assumption":[142],"differentiable":[147],"Q-linear":[150],"achieved":[153],"until":[154],"reaching":[155],"neighborhood":[157],"optimal,":[160],"can":[162],"be":[163],"managed":[164],"using":[165],"tolerance":[167],"value":[168],"on":[170],"protocol;":[175],"no":[176],"method":[178],"literature":[181],"has":[182],"strong":[184],"guarantees":[186,199],"necessarily":[189],"functions.":[192],"communication":[194],"overhead":[195],"these":[197],"improved":[198],"our":[201],"within":[204],"<inline-formula":[206,214],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[208,216],"notation=\"LaTeX\">$\\log":[209],"k$</tex-math></inline-formula>":[210],",":[211],"(at":[212],"notation=\"LaTeX\">$k{\\text{th}}$</tex-math></inline-formula>":[217],"algorithm)":[221],"factor":[222],"traditional":[225],"algorithms.":[226],"Further,":[227],"numerically":[229],"demonstrate":[230],"efficacy":[232],"solving":[238],"logistic":[241],"regression":[242],"problem.":[243]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}