{"id":"https://openalex.org/W7154225552","doi":"https://doi.org/10.48550/arxiv.2604.10422","title":"Distributed Optimization with Coupled Constraints over Time-Varying Digraph","display_name":"Distributed Optimization with Coupled Constraints over Time-Varying Digraph","publication_year":2026,"publication_date":"2026-04-12","ids":{"openalex":"https://openalex.org/W7154225552","doi":"https://doi.org/10.48550/arxiv.2604.10422"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.10422","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10422","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.10422","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133610478","display_name":"Yeong-Ung Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Yeong-Ung","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133562345","display_name":"Hyo-Sung Ahn","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ahn, Hyo-Sung","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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.41850000619888306,"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.41850000619888306,"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.1777999997138977,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.06350000202655792,"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/distributed-algorithm","display_name":"Distributed algorithm","score":0.6265000104904175},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6060000061988831},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5426999926567078},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5160999894142151},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5094000101089478},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4975999891757965},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4616999924182892},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4129999876022339},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.40059998631477356}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6470000147819519},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6265000104904175},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6060000061988831},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5426999926567078},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5160999894142151},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5128999948501587},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5094000101089478},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4975999891757965},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4129999876022339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40619999170303345},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.40059998631477356},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.37119999527931213},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3709999918937683},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.36739999055862427},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3402999937534332},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.3084999918937683},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.26409998536109924},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.10422","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10422","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.10422","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10422","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.4363960027694702,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,103],"develop":[4],"a":[5,10,24],"distributed":[6,13,73,83],"algorithm":[7,67,86,108,152],"for":[8,99],"solving":[9],"class":[11],"of":[12,38,92,116,120,143],"convex":[14,135],"optimization":[15,74],"problems":[16],"where":[17],"the":[18,55,65,72,90,106,127,141,150],"local":[19,130,144],"objective":[20,131],"functions":[21,132],"can":[22],"be":[23],"general":[25],"nonsmooth":[26],"function,":[27],"and":[28,31,51,62,140],"all":[29],"equalities":[30],"inequalities":[32,145],"are":[33,133],"network-wide":[34],"coupled.":[35],"This":[36,85],"type":[37],"problem":[39],"arises":[40],"from":[41],"many":[42],"areas,":[43],"such":[44,95],"as":[45,96],"economic":[46],"dispatch,":[47],"network":[48],"utility":[49],"maximization,":[50],"demand":[52],"response.":[53],"Integrating":[54],"decomposition":[56],"by":[57],"right":[58],"hand":[59],"side":[60],"allocation":[61],"primal-dual":[63],"methods,":[64],"proposed":[66,107,151],"is":[68,109,146],"able":[69],"to":[70,111,153],"handle":[71],"over":[75],"networks":[76],"with":[77],"time-varying":[78],"directed":[79],"graph":[80],"in":[81,118],"fully":[82],"fashion.":[84],"does":[87],"not":[88,137],"require":[89],"communication":[91],"sensitive":[93],"information,":[94],"primal":[97],"variables,":[98],"privacy":[100],"issues.":[101],"Further,":[102],"show":[104],"that":[105,129],"guaranteed":[110],"achieve":[112],"an":[113],"$O(1/k)$":[114],"rate":[115],"convergence":[117],"terms":[119],"optimality":[121],"based":[122],"on":[123],"duality":[124],"analysis":[125],"under":[126],"condition":[128],"strongly":[134],"but":[136],"necessarily":[138],"differentiable,":[139],"subdifferential":[142],"bounded.":[147],"We":[148],"simulate":[149],"demonstrate":[154],"its":[155],"remarkable":[156],"performance.":[157]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-15T00:00:00"}