{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T03:27:47Z","timestamp":1783481267368,"version":"3.55.0"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Knut and Alice Wallenberg Foundation the 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":["MoE Tier 1 RG72\/19"],"award-info":[{"award-number":["MoE Tier 1 RG72\/19"]}]},{"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"}]},{"name":"2020 Science and Technology Major Project of Liaoning Province","award":["2020JH1\/10100008"],"award-info":[{"award-number":["2020JH1\/10100008"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tac.2020.3030883","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T19:23:32Z","timestamp":1602617012000},"page":"4620-4635","source":"Crossref","is-referenced-by-count":103,"title":["Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4299-0471","authenticated-orcid":false,"given":"Xinlei","family":"Yi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4938-0468","authenticated-orcid":false,"given":"Xiuxian","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4090-8497","authenticated-orcid":false,"given":"Tao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7137-4136","authenticated-orcid":false,"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4623-1483","authenticated-orcid":false,"given":"Tianyou","family":"Chai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9940-5929","authenticated-orcid":false,"given":"Karl Henrik","family":"Johansson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"583","article-title":"Multi-scale exploration of convex functions and bandit convex optimization","author":"bubeck","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref38","first-page":"266","article-title":"Bandit convex optimization: $\\sqrt{T}$ regret in one dimension","author":"bubeck","year":"2015","journal-title":"Proc Conf Learn Theory"},{"key":"ref33","first-page":"345","article-title":"The price of bandit information for online optimization","author":"dani","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proc 17th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.3024321"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2914025"},{"key":"ref37","first-page":"784","article-title":"Bandit convex optimization: Towards tight bounds","author":"hazan","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref36","first-page":"636","article-title":"Improved regret guarantees for online smooth convex optimization with bandit feedback","author":"saha","year":"2011","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2192096"},{"key":"ref34","first-page":"263","article-title":"Competing in the dark: An efficient algorithm for bandit linear optimization","author":"abernethy","year":"2008","journal-title":"Proc Conf Learn Theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref27","first-page":"246","article-title":"Random optimization","volume":"26","author":"matyas","year":"1965","journal-title":"Autom Remote Control"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2336806"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2760284"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref20","article-title":"On the sublinear regret of distributed primal-dual algorithms for online constrained optimization","author":"lee","year":"2017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029474"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3021011"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219635"},{"key":"ref23","first-page":"1433","article-title":"Efficient regret minimization in non-convex games","author":"hazan","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref25","article-title":"Diminishing regret for online nonconvex optimization","author":"park","year":"2020"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ChiCC.2016.7554642"},{"key":"ref51","article-title":"Distributed online linear regression","author":"yuan","year":"2019"},{"key":"ref56","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","article-title":"Lectures on Convex Optimization","author":"nesterov","year":"2018"},{"key":"ref55","author":"facchinei","year":"2007","journal-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2015.11.093"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2964200"},{"key":"ref52","article-title":"Distributed online optimization with long-term constraints","author":"yuan","year":"2019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref11","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","author":"jenatton","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref40","article-title":"An optimal algorithm for bandit convex optimization","author":"hazan","year":"2016"},{"key":"ref12","first-page":"3280","article-title":"Safety-aware algorithms for adversarial contextual bandit","author":"sun","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref13","article-title":"Online convex optimization with time-varying constraints","author":"neely","year":"0","journal-title":"arXiv 1702 04783"},{"key":"ref14","first-page":"1428","article-title":"Online convex optimization with stochastic constraints","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","first-page":"1","article-title":"A low complexity algorithm with $ {O}(\\sqrt{T})$ regret and finite constraint violations for online convex optimization with long term constraints","volume":"21","author":"yu","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref16","first-page":"6140","article-title":"Online convex optimization for cumulative constraints","author":"yuan","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394209"},{"key":"ref18","first-page":"3944","article-title":"Cautious regret minimization: Online optimization with long-term budget constraints","author":"liakopoulos","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","first-page":"4410","article-title":"Online continuous DR-submodular maximization with long-term budget constraints","author":"sadeghi","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2755720"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref6","first-page":"225","article-title":"Linear hinge loss and average margin","author":"gentile","year":"1999","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/72.501719"},{"key":"ref8","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307410"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"ref9","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"Proc Conf Learn Theory"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2019.2921593"},{"key":"ref45","article-title":"Minimizing regret in bandit online optimization in unconstrained and constrained action spaces","author":"tatarenko","year":"2018"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2839563"},{"key":"ref47","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":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref41","first-page":"819","article-title":"(Bandit) convex optimization with biased noisy gradient oracles","author":"hu","year":"2016","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref44","first-page":"449","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","author":"yang","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","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"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9547356\/09222230.pdf?arnumber=9222230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:10Z","timestamp":1652194390000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9222230\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":56,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tac.2020.3030883","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":[[2021,10]]}}}