{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:19:43Z","timestamp":1771697983129,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1839429"],"award-info":[{"award-number":["ECCS-1839429"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/lcsys.2022.3230440","type":"journal-article","created":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T18:54:51Z","timestamp":1671562491000},"page":"979-984","source":"Crossref","is-referenced-by-count":5,"title":["Online Convex Optimization With Long-Term Constraints for Predictable Sequences"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7218-4545","authenticated-orcid":false,"given":"Deepan","family":"Muthirayan","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Sciences, University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"Yuan","sequence":"additional","affiliation":[{"name":"Expedia Group, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6634-6950","authenticated-orcid":false,"given":"Pramod P.","family":"Khargonekar","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Sciences, University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref2","first-page":"408","article-title":"The nonstochastic control problem","volume-title":"Proc. Mach. Learn. Res.","author":"Hazan"},{"key":"ref3","article-title":"Online learning for receding horizon control with provable regret guarantees","author":"Muthirayan","year":"2021","journal-title":"arXiv:2111.15041"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.1100.0583"},{"key":"ref5","first-page":"993","article-title":"Online learning with predictable sequences","volume-title":"Proc. Mach. Learn. Res.","author":"Rakhlin"},{"key":"ref6","first-page":"822","article-title":"Online learning with imperfect hints","volume-title":"Proc. Mach. Learn. Res.","author":"Bhaskara"},{"key":"ref7","article-title":"Regret and cumulative constraint violation analysis for online convex optimization with long term constraints","author":"Yi","year":"2021","journal-title":"arXiv:2106.05135"},{"issue":"1","key":"ref8","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":"ref9","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","volume-title":"Proc. Mach. Learn. Res.","author":"Jenatton"},{"key":"ref10","article-title":"Online convex optimization with stochastic constraints","author":"Yu","year":"2017","journal-title":"arXiv:1708.03741"},{"key":"ref11","article-title":"Online convex optimization for cumulative constraints","author":"Yuan","year":"2018","journal-title":"arXiv:1802.06472"},{"key":"ref12","article-title":"A low complexity algorithm with O(T) regret and O(1) constraint violations for online convex optimization with long term constraints","author":"Yu","year":"2016","journal-title":"arXiv:1604.02218"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_36"},{"key":"ref14","first-page":"5299","article-title":"Online learning with a hint","volume-title":"Proc. Mach. Learn. Res.","author":"Dekel"},{"key":"ref15","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. Mach. Learn. Res.","author":"Zinkevich"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7782633\/9828546\/9993746-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782633\/9828546\/09993746.pdf?arnumber=9993746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T11:57:48Z","timestamp":1706788668000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9993746\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2022.3230440","relation":{},"ISSN":["2475-1456"],"issn-type":[{"value":"2475-1456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}