{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:32:11Z","timestamp":1782315131830,"version":"3.54.5"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-16-1-0448"],"award-info":[{"award-number":["W911NF-16-1-0448"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["HDTRA1-13-1-0029"],"award-info":[{"award-number":["HDTRA1-13-1-0029"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1109\/tac.2020.3030743","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T19:23:32Z","timestamp":1602617012000},"page":"5049-5064","source":"Crossref","is-referenced-by-count":35,"title":["Constrained Online Convex Optimization With Feedback Delays"],"prefix":"10.1109","volume":"66","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-0002-3840-1753","authenticated-orcid":false,"given":"Junshan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2062-131X","authenticated-orcid":false,"given":"H. Vincent","family":"Poor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1428","article-title":"Online convex optimization with stochastic constraints","author":"yu","year":"0","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2839563"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"ref13","article-title":"The online saddle point problem: Applications to online convex optimization with knapsacks","author":"rivera","year":"2018"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref15","first-page":"2331","article-title":"Slow learners are fast","author":"langford","year":"0","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref16","first-page":"1453","article-title":"Online learning under delayed feedback","author":"joulani","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","first-page":"1270","article-title":"Online learning with adversarial delays","author":"quanrud","year":"0","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref18","first-page":"993","article-title":"Bandit online learning with unknown delays","author":"li","year":"0","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref19","first-page":"3086","article-title":"Online learning with local permutations and delayed feedback","author":"shamir","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"flaxman","year":"0","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref3","first-page":"748","article-title":"Online convex optimization with unconstrained domains and losses","author":"cutkosky","year":"0","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref6","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":"ref5","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2627401"},{"key":"ref2","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","article-title":"Online convex optimization with time-varying constraints","author":"neely","year":"2017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref20","first-page":"1160","article-title":"Online learning with switching costs and other adaptive adversaries","author":"cesa-bianchi","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","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":"ref21","first-page":"569","article-title":"Online learning with sample path constraints","volume":"10","author":"mannor","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422559"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9586335\/09222554.pdf?arnumber=9222554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:37Z","timestamp":1652194357000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9222554\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":24,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tac.2020.3030743","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,11]]}}}