{"id":"https://openalex.org/W7131250264","doi":"https://doi.org/10.1109/tcns.2026.3667777","title":"Primal-Dual Strategy for Composite Optimization Over Directed Graphs","display_name":"Primal-Dual Strategy for Composite Optimization Over Directed Graphs","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7131250264","doi":"https://doi.org/10.1109/tcns.2026.3667777"},"language":null,"primary_location":{"id":"doi:10.1109/tcns.2026.3667777","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcns.2026.3667777","pdf_url":null,"source":{"id":"https://openalex.org/S2502544478","display_name":"IEEE Transactions on Control of Network Systems","issn_l":"2325-5870","issn":["2325-5870","2372-2533"],"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 Control of Network Systems","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/A5123201923","display_name":"Sajad Zandi","orcid":null},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Sajad Zandi","raw_affiliation_strings":["Centre for Audio, Acoustics and Vibration, Faculty of Engineering and IT, University of Technology Sydney, Ultimo, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0003-2247-5595","affiliations":[{"raw_affiliation_string":"Centre for Audio, Acoustics and Vibration, Faculty of Engineering and IT, University of Technology Sydney, Ultimo, NSW, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113928558","display_name":"Meisam Esfandiari","orcid":"https://orcid.org/0009-0003-0883-5117"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Meisam Esfandiari","raw_affiliation_strings":["Faculty of Engineering and IT, University of Technology Sydney, Ultimo, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0002-7063-2738","affiliations":[{"raw_affiliation_string":"Faculty of Engineering and IT, University of Technology Sydney, Ultimo, NSW, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021281591","display_name":"Sipei Zhao","orcid":"https://orcid.org/0000-0002-6261-8864"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Sipei Zhao","raw_affiliation_strings":["Centre for Audio, Acoustics and Vibration, Faculty of Engineering and IT, University of Technology Sydney, Ultimo, NSW, Australia"],"raw_orcid":"https://orcid.org/0000-0002-6261-8864","affiliations":[{"raw_affiliation_string":"Centre for Audio, Acoustics and Vibration, Faculty of Engineering and IT, University of Technology Sydney, Ultimo, NSW, Australia","institution_ids":["https://openalex.org/I114017466"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114017466"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2260411,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"2","first_page":"899","last_page":"911"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.31439998745918274,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.31439998745918274,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.08889999985694885,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0560000017285347,"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/convexity","display_name":"Convexity","score":0.7491000294685364},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7146000266075134},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5958999991416931},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5873000025749207},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5045999884605408},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.498199999332428},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4587000012397766},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4546000063419342},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4244999885559082}],"concepts":[{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.7491000294685364},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7146000266075134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6365000009536743},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5958999991416931},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5900999903678894},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5873000025749207},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5045999884605408},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.498199999332428},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4587000012397766},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4546000063419342},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3474000096321106},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3280999958515167},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2953000068664551},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C3020028006","wikidata":"https://www.wikidata.org/wiki/Q9158","display_name":"Electronic mail","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2685999870300293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26739999651908875},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.25999999046325684}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcns.2026.3667777","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcns.2026.3667777","pdf_url":null,"source":{"id":"https://openalex.org/S2502544478","display_name":"IEEE Transactions on Control of Network Systems","issn_l":"2325-5870","issn":["2325-5870","2372-2533"],"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 Control of Network Systems","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":40,"referenced_works":["https://openalex.org/W1571416372","https://openalex.org/W1616857247","https://openalex.org/W1994860969","https://openalex.org/W2044212084","https://openalex.org/W2070712430","https://openalex.org/W2086502731","https://openalex.org/W2119380668","https://openalex.org/W2123705108","https://openalex.org/W2132650954","https://openalex.org/W2137435346","https://openalex.org/W2148087609","https://openalex.org/W2155356457","https://openalex.org/W2291434103","https://openalex.org/W2476071355","https://openalex.org/W2590635385","https://openalex.org/W2609549560","https://openalex.org/W2617089797","https://openalex.org/W2763533254","https://openalex.org/W2792751837","https://openalex.org/W2807424650","https://openalex.org/W2962840086","https://openalex.org/W2963213190","https://openalex.org/W2963649943","https://openalex.org/W2964017936","https://openalex.org/W2964103300","https://openalex.org/W2964165783","https://openalex.org/W3117167726","https://openalex.org/W3163505053","https://openalex.org/W3174143153","https://openalex.org/W4210318966","https://openalex.org/W4226170071","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W4311114086","https://openalex.org/W4386432161","https://openalex.org/W4397002057","https://openalex.org/W4399602238","https://openalex.org/W4402215723","https://openalex.org/W4405907033","https://openalex.org/W4406610144"],"related_works":[],"abstract_inverted_index":{"We":[0,97],"introduce":[1],"a":[2,20,27],"distributed":[3,140],"optimization":[4,141],"framework":[5],"for":[6,136],"directed":[7,45,143],"graph":[8],"networks":[9],"that":[10,32],"addresses":[11],"composite":[12],"objective":[13],"functions":[14],"with":[15],"smooth":[16],"local":[17],"components":[18],"and":[19,38,71,79,94,103,117,138],"shared":[21],"convex":[22],"regulariser.":[23],"Our":[24],"method":[25,135],"employs":[26],"novel":[28],"primal-dual":[29],"(PD)":[30],"algorithm":[31,111],"incorporates":[33],"time-varying":[34],"adaptive":[35,82],"coefficient":[36],"weights":[37,83],"operates":[39],"efficiently":[40],"under":[41,55,67],"the":[42,100,105,109,122,125,130,133],"constraints":[43],"of":[44,108,132],"network":[46],"topologies.":[47],"The":[48,81],"proposed":[49,110,134],"approach":[50,63],"achieves":[51],"provable":[52],"convergence":[53,66,101,116],"guarantees":[54,64],"strong":[56,68],"convexity":[57,69],"conditions.":[58],"Unlike":[59],"existing":[60],"methods,":[61],"our":[62],"linear":[65],"assumptions":[70],"introduces":[72],"new":[73],"step-size":[74],"bounds,":[75],"improving":[76],"both":[77],"stability":[78],"performance.":[80],"dynamically":[84],"optimize":[85],"information":[86],"sharing":[87],"among":[88],"agents,":[89],"significantly":[90],"reducing":[91],"communication":[92],"costs":[93],"enhancing":[95],"robustness.":[96],"theoretically":[98],"establish":[99],"properties":[102],"demonstrate":[104],"superior":[106],"performance":[107],"through":[112],"simulations,":[113],"showcasing":[114],"faster":[115],"improved":[118],"accuracy":[119],"compared":[120],"to":[121],"methods":[123],"in":[124,142],"literature.":[126],"These":[127],"results":[128],"highlight":[129],"potential":[131],"scalable":[137],"efficient":[139],"networks.":[144]},"counts_by_year":[],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2026-02-25T00:00:00"}