{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T05:10:16Z","timestamp":1756271416228,"version":"3.44.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T00:00:00Z","timestamp":1748217600000},"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":[],"published-print":{"date-parts":[[2025,5,26]]},"DOI":"10.23919\/wiopt66569.2025.11123286","type":"proceedings-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T19:04:05Z","timestamp":1756235045000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost"],"prefix":"10.23919","author":[{"given":"Rahul","family":"Vaze","sequence":"first","affiliation":[{"name":"xx"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayakrishnan","family":"Nair","sequence":"additional","affiliation":[{"name":"xx"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210385"},{"journal-title":"Online convex optimization against adversaries with memory and application to statistical arbitrage","year":"2013","author":"Anava","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465533"},{"first-page":"219","volume-title":"Dimension-free bounds for chasing convex functions. In Conference on Learning Theory","author":"Argue","key":"ref4"},{"journal-title":"A2-competitive algorithm for online convex optimization with switching costs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik","year":"2015","author":"Bansal","key":"ref5"},{"journal-title":"Best of both worlds: Stochastic and adversarial convex function chasing","year":"2023","author":"Bhuyan","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2745844"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901464"},{"key":"ref9","first-page":"1574","volume-title":"Smoothed online convex optimization in high dimensions via online balanced descent. In Conference On Learning Theory","author":"Chen","year":"2018"},{"first-page":"1574","volume-title":"Smoothed online convex optimization in high dimensions via online balanced descent. In Conference On Learning Theory","author":"Chen","key":"ref10"},{"first-page":"867","volume-title":"Chasing convex bodies and functions with black-box advice. In Conference on Learning Theory","author":"Christianson","key":"ref11"},{"journal-title":"Beyond online balanced descent: An optimal algorithm for smoothed online optimization. Adv. Neural Inf. Process. Syst., 32","year":"2019","author":"Goel","key":"ref12"},{"key":"ref13","first-page":"25042513","volume-title":"An online algorithm for smoothed regression and LQR control. Proceedings of Machine Learning Research","volume":"89","author":"Goel"},{"journal-title":"Online convex optimization with unbounded memory. Advances in Neural Information Processing Systems, 36","year":"2024","author":"Kumar","key":"ref14"},{"journal-title":"Chasing convex functions with long-term constraints","year":"2024","author":"Lechowicz","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.23919\/acc.2018.8431296"},{"issue":"5","key":"ref17","first-page":"1378","volume":"21","author":"Lin","year":"2012","journal-title":"Dynamic rightsizing for power-proportional data centers. IEEE\/ACM Transactions on Networking"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2425248.2425275"},{"key":"ref19","first-page":"755","volume-title":"Lagrangian duality in online scheduling with resource augmentation and speed scaling. In Algorithms-ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France","author":"Nguyen","year":"2013"},{"journal-title":"A modern introduction to online learning","year":"2019","author":"Orabona","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3579442"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3649477.3649490"},{"key":"ref23","first-page":"20636","volume":"33","author":"Shi","year":"2020","journal-title":"Online optimization with memory and competitive control. Advances in Neural Information Processing Systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/9781009349178"},{"journal-title":"Capacity provisioning motivated online non-convex optimization problem with memory and switching cost","year":"2024","author":"Vaze","key":"ref25"},{"journal-title":"Revisiting smoothed online learning. CoRR","year":"2021","author":"Zhang","key":"ref26"}],"event":{"name":"2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","start":{"date-parts":[[2025,5,26]]},"location":"Linkoping, Sweden","end":{"date-parts":[[2025,5,29]]}},"container-title":["2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11123177\/11123184\/11123286.pdf?arnumber=11123286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T04:53:21Z","timestamp":1756270401000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11123286\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,26]]},"references-count":26,"URL":"https:\/\/doi.org\/10.23919\/wiopt66569.2025.11123286","relation":{},"subject":[],"published":{"date-parts":[[2025,5,26]]}}}