{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:39:15Z","timestamp":1784205555390,"version":"3.55.0"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swedish Foundation for Strategic Research"},{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education of Republic of Singapore","award":["AcRF TIER 1- 2019-T1-001-088"],"award-info":[{"award-number":["AcRF TIER 1- 2019-T1-001-088"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62003243"],"award-info":[{"award-number":["62003243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61991403"],"award-info":[{"award-number":["61991403"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61991404"],"award-info":[{"award-number":["61991404"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61991400"],"award-info":[{"award-number":["61991400"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tac.2022.3230766","type":"journal-article","created":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T13:41:37Z","timestamp":1671543697000},"page":"2875-2890","source":"Crossref","is-referenced-by-count":33,"title":["Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4299-0471","authenticated-orcid":false,"given":"Xinlei","family":"Yi","sequence":"first","affiliation":[{"name":"Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4938-0468","authenticated-orcid":false,"given":"Xiuxian","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Control Science and Engineering, College of Electronics and Information Engineering, and the Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4090-8497","authenticated-orcid":false,"given":"Tao","family":"Yang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7137-4136","authenticated-orcid":false,"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4623-1483","authenticated-orcid":false,"given":"Tianyou","family":"Chai","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9940-5929","authenticated-orcid":false,"given":"Karl Henrik","family":"Johansson","sequence":"additional","affiliation":[{"name":"Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref57","article-title":"Regret and cumulative constraint violation analysis for distributed online constrained convex optimization","author":"yi","year":"2021"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2021.3107480"},{"key":"ref15","first-page":"1323","article-title":"Adaptive online learning in dynamic environments","author":"zhang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref14","first-page":"1","article-title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","volume":"18","author":"shamir","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref58","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","article-title":"Distributed subgradient methods for multi-agent optimization","volume":"54","author":"nedi?","year":"2009","journal-title":"IEEE Trans Autom Control"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3021011"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2650563"},{"key":"ref11","first-page":"449","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","author":"yang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3030883"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2019.2921593"},{"key":"ref16","first-page":"5882","article-title":"Dynamic regret of strongly adaptive methods","author":"zhang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","first-page":"2503","article-title":"Trading regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"mahdavi","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/731"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2573639"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2011.5991212"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2755720"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2022.3232519"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3057601"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029304"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2860546"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref44","first-page":"9818","article-title":"Projection-free distributed online convex optimization with $ O(\\sqrt{T})$ communication complexity","author":"wan","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029474"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF53345.2021.9723285"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref7","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref9","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/72.501719"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.1100.0583"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307410"},{"key":"ref5","first-page":"225","article-title":"Linear hinge loss and average margin","author":"gentile","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2505149"},{"key":"ref35","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","author":"koloskova","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3392157"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2363554"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483272"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2860281"},{"key":"ref33","first-page":"4410","article-title":"Online continuous DR-submodular maximization with long-term budget constraints","author":"sadeghi","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref32","first-page":"3944","article-title":"Cautious regret minimization: Online optimization with long-term budget constraints","author":"liakopoulos","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref1","first-page":"551","article-title":"Online passive aggressive algorithms","volume":"7","author":"crammer","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525928"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2627401"},{"key":"ref23","first-page":"11998","article-title":"Regret and cumulative constraint violation analysis for online convex optimization with long term constraints","author":"yi","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","first-page":"1428","article-title":"Online convex optimization with stochastic constraints","author":"yu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","first-page":"3280","article-title":"Safety-aware algorithms for adversarial contextual bandit","author":"sun","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref20","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","author":"jenatton","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","first-page":"1","article-title":"A low complexity algorithm with $ O(\\sqrt{T})$ regret and $ O(1)$ constraint violations for online convex optimization with long term constraints","volume":"21","author":"yu","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref21","first-page":"6140","article-title":"Online convex optimization for cumulative constraints","author":"yuan","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref27","article-title":"Online convex optimization with time-varying constraints","author":"neely","year":"2017"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2839563"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10109211\/09993770.pdf?arnumber=9993770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T15:05:24Z","timestamp":1684163124000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9993770\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":59,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3230766","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}