{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T02:57:19Z","timestamp":1782961039723,"version":"3.54.5"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/tac.2018.2884653","type":"journal-article","created":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T23:53:01Z","timestamp":1543881181000},"page":"2665-2680","source":"Crossref","is-referenced-by-count":82,"title":["Online Convex Optimization With Time-Varying Constraints and Bandit Feedback"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0190-4362","authenticated-orcid":false,"given":"Xuanyu","family":"Cao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5469-5811","authenticated-orcid":false,"given":"K. J. Ray","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref15","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proc 16th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref16","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"Proc 23rd Annu Conf Learn Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745854"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901464"},{"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":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2760256"},{"key":"ref4","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2728498"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465551"},{"key":"ref29","author":"rockafellar","year":"2015","journal-title":"Convex Analysis"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2551282"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2592004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2226216"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2013.08.014"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref20","first-page":"1119","article-title":"Online alternating direction method","author":"wang","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2686368"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2627401"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2192096"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2568161"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/8746736\/08556020.pdf?arnumber=8556020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:48:34Z","timestamp":1657745314000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8556020\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":29,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tac.2018.2884653","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":[[2019,7]]}}}