{"id":"https://openalex.org/W7220460160","doi":"https://doi.org/10.48550/arxiv.2610.03709","title":"From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing","display_name":"From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing","publication_year":2026,"publication_date":"2026-10-02","ids":{"openalex":"https://openalex.org/W7220460160","doi":"https://doi.org/10.48550/arxiv.2610.03709"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.03709","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.03709","pdf_url":"https://arxiv.org/pdf/2610.03709","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.03709","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104183700","display_name":"Kuangyu Ding","orcid":"https://orcid.org/0000-0002-5131-2106","observed_orcids":["https://orcid.org/0000-0002-5131-2106"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ding, Kuangyu","raw_affiliation_strings":["School of Industrial Engineering , Purdue University , West Lafayette , IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering , Purdue University , West Lafayette , IN","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041765559","display_name":"Gesualdo Scutari","orcid":"https://orcid.org/0000-0002-6453-6870","observed_orcids":["https://orcid.org/0000-0002-6453-6870"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scutari, Gesualdo","raw_affiliation_strings":["School of Industrial Engineering , Purdue University , West Lafayette , IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering , Purdue University , West Lafayette , IN","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.0010000000474974513,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.00039999998989515007,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/distributed-optimization","display_name":"distributed optimization","score":0.9779999852180481},{"id":"https://openalex.org/keywords/graph-decomposition","display_name":"graph decomposition","score":0.9789999723434448},{"id":"https://openalex.org/keywords/message-passing","display_name":"message passing","score":0.8410000205039978},{"id":"https://openalex.org/keywords/strongly-convex-functions","display_name":"strongly convex functions","score":0.7279999852180481},{"id":"https://openalex.org/keywords/linear-convergence","display_name":"linear convergence","score":0.7490000128746033},{"id":"https://openalex.org/keywords/preconditioning","display_name":"preconditioning","score":0.6819999814033508},{"id":"https://openalex.org/keywords/gates","display_name":"gates","score":0.48100000619888306},{"id":"https://openalex.org/keywords/consensus-based-optimization","display_name":"consensus-based optimization","score":0.5210000276565552},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"communication complexity","score":0.4869999885559082}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5321999788284302},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5156000256538391},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.508400022983551},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4595000147819519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.414000004529953},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4106999933719635},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38449999690055847},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3828999996185303},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3785000145435333},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.36010000109672546},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3569999933242798},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.31690001487731934},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.3082999885082245},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.30219998955726624},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2800999879837036},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.25850000977516174},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.2547999918460846}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.03709","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.03709","pdf_url":"https://arxiv.org/pdf/2610.03709","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.03709","doi":"https://doi.org/10.48550/arxiv.2610.03709","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.03709","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.03709","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.03709","pdf_url":"https://arxiv.org/pdf/2610.03709","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7220460160.pdf","grobid_xml":"https://content.openalex.org/works/W7220460160.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3089960935","https://openalex.org/W4383534883","https://openalex.org/W3196969702","https://openalex.org/W3030545591","https://openalex.org/W4404407344","https://openalex.org/W4393092629","https://openalex.org/W4415624369","https://openalex.org/W4417081335","https://openalex.org/W3185147383","https://openalex.org/W2894941002"],"abstract_inverted_index":{"We":[0,56,159],"study":[1],"decentralized":[2,23],"minimization":[3],"of":[4,6,201,232],"sums":[5],"smooth":[7],"strongly":[8],"convex":[9],"functions,":[10],"one":[11,116],"per":[12,119],"agent,":[13],"with":[14,53,131,223],"communication":[15],"restricted":[16],"to":[17,36,67,154],"neighbors":[18],"in":[19,229,251],"a":[20,27,58,171],"graph.":[21],"Existing":[22],"algorithms":[24],"typically":[25],"emulate":[26],"{\\it":[28,31,59,176,226],"centralized}":[29],"method;":[30],"the":[32,43,47,65,69,93,102,112,123,166,173,184,190,198,204,209,220,224,230,246],"network":[33,66],"serves":[34],"only":[35],"exchange":[37],"information},":[38],"from":[39],"which":[40,82,89],"agents":[41,94,233],"approximate":[42],"global":[44],"quantities":[45],"that":[46,63,136,165],"method":[48],"needs.":[49],"This":[50],"paper":[51],"breaks":[52],"this":[54],"paradigm.":[55],"introduce":[57],"graph":[60],"decomposition":[61],"framework}":[62],"uses":[64,147],"design":[68,168],"method,":[70],"not":[71],"merely":[72],"execute":[73],"it.":[74],"It":[75],"jointly":[76,86],"determines":[77],"how":[78],"agreement":[79],"is":[80,217],"imposed,":[81],"variables":[83],"are":[84],"optimized":[85],"(blocks),":[87],"and":[88,121,151,157,163,180,236,249,253],"connected":[90],"subgraphs":[91],"host":[92],"solving":[95],"each":[96,140,202],"block.":[97],"The":[98],"convergence":[99,162,216],"analysis":[100],"quantifies":[101],"trade-offs":[103],"among":[104],"these":[105],"choices.":[106],"GATE":[107],"(Graph-Tearing":[108],"message":[109,133],"passing)":[110],"instantiates":[111],"framework":[113],"by":[114],"assigning":[115],"dual":[117],"variable":[118],"edge":[120,129],"partitioning":[122],"edges":[124],"into":[125],"trees.":[126],"Agents":[127],"interleave":[128],"updates":[130],"local":[132,149],"passing":[134],"recursions":[135],"summarize":[137],"optimization":[138,195],"within":[139],"tree":[141,225],"(block).":[142],"Its":[143],"surrogate":[144],"variant,":[145],"GATE-S,":[146],"tractable":[148],"models":[150],"compact":[152],"messages":[153],"reduce":[155],"computation":[156],"communication.":[158,254],"establish":[160],"linear":[161],"show":[164],"topology-aware":[167],"acts":[169],"as":[170],"\\emph{preconditioner}:":[172],"rate":[174,221],"depends":[175],"jointly}":[177],"on":[178,189,234],"topology":[179],"function":[181],"geometry":[182],"through":[183],"coupling":[185],"between":[186],"subproblems":[187],"defined":[188],"selected":[191],"subgraphs,":[192],"whereas":[193],"consensus-based":[194],"methods":[196],"pay":[197],"worst":[199],"case":[200],"separately,":[203],"centralized":[205],"condition":[206],"number":[207,231],"times":[208],"inverse":[210],"spectral":[211],"gap.":[212],"On":[213],"tree-dominant":[214],"graphs,":[215],"provably":[218],"faster:":[219],"scales":[222],"diameter},":[227],"linearly":[228],"rings":[235],"barbells":[237],"against":[238],"quadratically":[239],"for":[240],"non-accelerated":[241],"consensus-optimization":[242],"methods.":[243],"Experiments":[244],"support":[245],"predicted":[247],"scaling":[248],"savings":[250],"iterations":[252]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-10-06T00:00:00"}