{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T16:14:02Z","timestamp":1774541642772,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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"}]},{"DOI":"10.13039\/501100001729","name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]},{"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":["1 RG72\/19"],"award-info":[{"award-number":["1 RG72\/19"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsp.2020.2964200","type":"journal-article","created":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T20:25:32Z","timestamp":1578342332000},"page":"731-746","source":"Crossref","is-referenced-by-count":139,"title":["Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4299-0471","authenticated-orcid":false,"given":"Xinlei","family":"Yi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4938-0468","authenticated-orcid":false,"given":"Xiuxian","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7137-4136","authenticated-orcid":false,"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9940-5929","authenticated-orcid":false,"given":"Karl H.","family":"Johansson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","first-page":"14","article-title":"Composite objective mirror descent","author":"duchi","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref31","author":"shalev-shwartz","year":"2007","journal-title":"Logarithmic Regret Algorithms for Strongly Convex Repeated Games"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref10","first-page":"6140","article-title":"Online convex optimization for cumulative constraints","author":"yuan","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","first-page":"3280","article-title":"Safety-aware algorithms for adversarial contextual bandit","author":"sun","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref13","first-page":"1428","article-title":"Online convex optimization with stochastic constraints","author":"yu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","article-title":"Online convex optimization with time-varying constraints","author":"neely","year":"2017"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2839563"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2627401"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483272"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.191"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref28","article-title":"Distributed constrained online learning","author":"paternain","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref27","article-title":"Distributed online optimization for multi-agent networks with coupled inequality constraints","author":"li","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref6","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","author":"zhang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref8","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":"ref7","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":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref9","article-title":"A low complexity algorithm with $ {O}(\\sqrt{T})$ regret and finite constraint violations for online convex optimization with long term constraints","author":"yu","year":"2016"},{"key":"ref1","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":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525928"},{"key":"ref22","article-title":"Distributed online linear regression","author":"yuan","year":"2019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref26","article-title":"On the sublinear regret of distributed primal-dual algorithms for online constrained optimization","author":"lee","year":"2017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2755720"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/08950383.pdf?arnumber=8950383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:21Z","timestamp":1651070481000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8950383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.2964200","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}