{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T14:57:52Z","timestamp":1777388272433,"version":"3.51.4"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ERC","award":["TRUST-949796"],"award-info":[{"award-number":["TRUST-949796"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tac.2023.3237486","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T14:07:24Z","timestamp":1673878044000},"page":"2906-2921","source":"Crossref","is-referenced-by-count":6,"title":["Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6752-6328","authenticated-orcid":false,"given":"Pedro Zattoni","family":"Scroccaro","sequence":"first","affiliation":[{"name":"Delft Center for Systems and Control, TU Delft, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2336-6462","authenticated-orcid":false,"given":"Arman Sharifi","family":"Kolarijani","sequence":"additional","affiliation":[{"name":"Delft Center for Systems and Control, TU Delft, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1286-8782","authenticated-orcid":false,"given":"Peyman Mohajerin","family":"Esfahani","sequence":"additional","affiliation":[{"name":"Delft Center for Systems and Control, TU Delft, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"993","article-title":"Online learning with predictable sequences","author":"rakhlin","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2452831"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1262-8"},{"key":"ref14","first-page":"3066","article-title":"Optimization, learning, and games with predictable sequences","author":"rakhlin","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.01.006"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988614"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2294622"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2019.XV.033"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref16","first-page":"398","article-title":"Online optimization: Competing with dynamic comparators","author":"jadbabaie","year":"0","journal-title":"Proc 18th Int Conf Artif Intell Statist"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5418-8"},{"key":"ref51","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume":"137","author":"nesterov","year":"2018","journal-title":"Convex Optimization Lecture Notes"},{"key":"ref50","first-page":"848","article-title":"Accelerating online convex optimization via adaptive prediction","author":"mohri","year":"0","journal-title":"Artif Intell s"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9030013"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.108771"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_37"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16858"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3508038"},{"key":"ref41","first-page":"1994","article-title":"The power of predictions in online control","volume":"33","author":"yu","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref44","first-page":"2020","article-title":"Online learning with imperfect hints","author":"bhaskara","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","first-page":"5299","article-title":"Online learning with a hint","author":"dekel","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref49","article-title":"Adaptive composite online optimization: Predictions in static and dynamic environments","author":"zattoni scroccaro","year":"2022"},{"key":"ref8","article-title":"Logarithmic regret for online control","author":"agarwal","year":"0","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref7","first-page":"111","article-title":"Online control with adversarial disturbances","author":"agarwal","year":"0","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref9","first-page":"408","article-title":"The nonstochastic control problem","author":"hazan","year":"0","journal-title":"Proc 31st Int Conf Algorithmic Learn Theory"},{"key":"ref4","article-title":"Lecture Notes: Introduction to online optimization","author":"bubeck","year":"2011"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/9781601985477"},{"key":"ref6","first-page":"415","article-title":"Optimal strategies and minimax lower bounds for online convex games","author":"abernethy","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref5","article-title":"Logarithmic regret algorithms for strongly convex repeated games","author":"shalev-shwartz","year":"2007"},{"key":"ref40","article-title":"Online optimal control with linear dynamics and predictions: Algorithms and regret analysis","volume":"32","author":"li","year":"2019","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745854"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref37","first-page":"1","article-title":"Online optimization with predictions and non-convex losses","volume":"4","author":"lin","year":"0","journal-title":"Proc ACM Meas Anal Comput Syst"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901464"},{"key":"ref31","first-page":"12377","article-title":"Temporal variability in implicit online learning","volume":"33","author":"campolongo","year":"0","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref30","first-page":"575","article-title":"Implicit online learning","author":"kulis","year":"0","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref33","article-title":"Fully implicit online learning","author":"song","year":"2018"},{"key":"ref32","article-title":"A unified view of regularized dual averaging and mirror descent with implicit updates","author":"mcmahan","year":"2010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3040249"},{"key":"ref38","first-page":"14520","article-title":"Leveraging predictions in smoothed online convex optimization via gradient-based algorithms","volume":"33","author":"li","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"1323","article-title":"Adaptive online learning in dynamic environments","author":"zhang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","first-page":"579","article-title":"Dynamical models and tracking regret in online convex programming","author":"hall","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref26","first-page":"14","article-title":"Composite Objective Mirror Descent.","volume":"10","author":"duchi","year":"2010","journal-title":"COLT"},{"key":"ref25","article-title":"A closer look at temporal variability in dynamic online learning","author":"campolongo","year":"2021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref21","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"0","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10109211\/10018217.pdf?arnumber=10018217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T15:05:51Z","timestamp":1684163151000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10018217\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":53,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tac.2023.3237486","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":[[2023,5]]}}}