{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:48:29Z","timestamp":1747284509026,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/cdc40024.2019.9030264","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T04:43:11Z","timestamp":1584074591000},"page":"555-560","source":"Crossref","is-referenced-by-count":3,"title":["A Distributed Algorithm for Online Convex Optimization with Time-Varying Coupled Inequality Constraints"],"prefix":"10.1109","author":[{"given":"Xinlei","family":"Yi","sequence":"first","affiliation":[]},{"given":"Xiuxian","family":"Li","sequence":"additional","affiliation":[]},{"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Karl H.","family":"Johansson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"6140","article-title":"Online convex optimization for cumulative constraints","author":"yuan","year":"2018"},{"key":"ref11","first-page":"3280","article-title":"Safety-aware algorithms for adversarial contextual bandit","author":"sun","year":"2017","journal-title":"International Conference on Machine Learning"},{"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":"2017","journal-title":"Advances in neural information processing systems"},{"article-title":"Online convex optimization with time-varying constraints","year":"2017","author":"neely","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483272"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.191"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525928"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"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":"2017","journal-title":"Advances in neural information processing systems"},{"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":"2016","journal-title":"International Conference on Machine Learning"},{"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":"Journal of Machine Learning Research"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"article-title":"A low complexity algorithm with $O\\left( {\\sqrt T } \\right)$ regret and finite constraint violations for online convex optimization with long term constraints","year":"2016","author":"yu","key":"ref9"},{"key":"ref1","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"International Conference on Machine Learning"},{"key":"ref20","article-title":"An adaptive primal-dual subgradient algorithm for online distributed constrained optimization","author":"yuan","year":"2017","journal-title":"IEEE Transactions on Cybernetics"},{"article-title":"Distributed online optimization for multiagent networks with coupled inequality constraints","year":"2018","author":"li","key":"ref22"},{"article-title":"On the sublinear regret of distributed primal-dual algorithms for online constrained optimization","year":"2017","author":"lee","key":"ref21"},{"key":"ref24","first-page":"14","article-title":"Composite objective mirror descent","author":"duchi","year":"2010","journal-title":"Conference on Learning Theory"},{"article-title":"Distributed constrained online learning","year":"2019","author":"paternain","key":"ref23"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9030264"}],"event":{"name":"2019 IEEE 58th Conference on Decision and Control (CDC)","start":{"date-parts":[[2019,12,11]]},"location":"Nice, France","end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE 58th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977134\/9028853\/09030264.pdf?arnumber=9030264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:24:32Z","timestamp":1658262272000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9030264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/cdc40024.2019.9030264","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}