{"id":"https://openalex.org/W7128674751","doi":"https://doi.org/10.48550/arxiv.2602.10452","title":"Distributed Online Convex Optimization with Nonseparable Costs and Constraints","display_name":"Distributed Online Convex Optimization with Nonseparable Costs and Constraints","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128674751","doi":"https://doi.org/10.48550/arxiv.2602.10452"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.10452","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111193721","display_name":"Zhaoye Pan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pan, Zhaoye","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078044351","display_name":"Haozhe Lei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lei, Haozhe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020823981","display_name":"Fan Zuo","orcid":"https://orcid.org/0000-0002-6761-2808"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zuo, Fan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086380403","display_name":"Zilin Bian","orcid":"https://orcid.org/0000-0003-3514-9369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bian, Zilin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125743058","display_name":"Tao Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Tao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"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.6711999773979187,"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.6711999773979187,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.14350000023841858,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.04960000142455101,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7042999863624573},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5982000231742859},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5486000180244446},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5357000231742859},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5013999938964844},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.47859999537467957},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4499000012874603},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4489000141620636}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7042999863624573},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5982000231742859},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5953999757766724},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5486000180244446},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5357000231742859},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5013999938964844},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.47859999537467957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4526999890804291},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4489000141620636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4368000030517578},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C2779582901","wikidata":"https://www.wikidata.org/wiki/Q21013010","display_name":"Distributed learning","level":2,"score":0.3939000070095062},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37860000133514404},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.37720000743865967},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.3682999908924103},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.33329999446868896},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.26350000500679016}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.10452","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.10452","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.10452","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":"pmh:doi:10.48550/arxiv.2602.10452","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.45600104331970215,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"distributed":[3,13,83],"online":[4,14,84,176,182],"convex":[5,178],"optimization":[6],"with":[7,107],"time-varying":[8],"coupled":[9,30],"constraints,":[10],"motivated":[11],"by":[12],"control":[15],"in":[16,152],"network":[17],"systems.":[18],"Most":[19],"prior":[20],"work":[21],"assumes":[22],"a":[23,45,51,60,82,95,161],"separability":[24,117],"condition:":[25],"the":[26,99,111,133,138,157,164,172,181,186],"global":[27,64,100],"objective":[28],"and":[29,38,67,77,93,137,145,170],"constraint":[31,140,147],"functions":[32,66],"are":[33,104],"sums":[34],"of":[35,47,62,98,175,188],"local":[36,96,125],"costs":[37],"individual":[39],"constraints.":[40],"In":[41],"contrast,":[42],"we":[43],"study":[44],"group":[46],"agents,":[48],"networked":[49],"via":[50],"communication":[52,189],"graph,":[53],"that":[54,118],"collectively":[55],"select":[56],"actions":[57],"to":[58,68,121],"minimize":[59],"sequence":[61],"nonseparable":[63,70],"cost":[65,187],"satisfy":[69],"long-term":[71],"constraints":[72],"based":[73],"on":[74],"full-information":[75],"feedback":[76],"intra-agent":[78],"communication.":[79],"We":[80],"propose":[81],"primal-dual":[85,114],"belief":[86,97],"consensus":[87,113,135],"algorithm,":[88],"where":[89,154],"each":[90],"agent":[91],"maintains":[92],"updates":[94],"collective":[101],"decisions,":[102,126],"which":[103],"repeatedly":[105],"exchanged":[106],"neighboring":[108],"agents.":[109],"Unlike":[110],"previous":[112],"algorithms":[115],"under":[116],"ask":[119],"agents":[120],"only":[122],"communicate":[123],"their":[124],"our":[127],"belief-sharing":[128],"protocol":[129],"eliminates":[130],"coupling":[131],"between":[132],"primal":[134],"disagreement":[136],"dual":[139],"violation,":[141],"yielding":[142],"sublinear":[143],"regret":[144],"cumulative":[146],"violation":[148],"(CCV)":[149],"bounds,":[150],"both":[151],"$O({T}^{1/2})$,":[153],"$T$":[155],"denotes":[156],"time":[158],"horizon.":[159],"Such":[160],"result":[162],"breaks":[163],"long-standing":[165],"$O(T^{3/4})$":[166],"barrier":[167],"for":[168],"CCV":[169],"matches":[171],"lower":[173],"bound":[174],"constrained":[177],"optimization,":[179],"indicating":[180],"learning":[183],"efficiency":[184],"at":[185],"overhead.":[190]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-13T00:00:00"}