{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:38:56Z","timestamp":1730230736282,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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":[[2020,5]]},"DOI":"10.1109\/icassp40776.2020.9052961","type":"proceedings-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T16:21:13Z","timestamp":1586449273000},"page":"4970-4974","source":"Crossref","is-referenced-by-count":1,"title":["Robust Online Mirror Saddle-Point Method for Constrained Resource Allocation"],"prefix":"10.1109","author":[{"given":"Ezra","family":"Tampubolon","sequence":"first","affiliation":[]},{"given":"Holger","family":"Boche","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1201\/b19011","article-title":"Online Portfolio Selection: Principles and Algorithms","author":"li","year":"2018"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.2200\/S00271ED1V01Y201006CNT007"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/1785481.1785532"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/JIOT.2018.2860281"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/JIOT.2018.2839563"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/JPROC.2019.2896243"},{"key":"ref14","article-title":"Learning in games with continuous action sets and unknown payoff functions","author":"mertikopoulos","year":"2018","journal-title":"Math Prog"},{"year":"2019","author":"tampubolon","article-title":"Pricing mechanism for resource sustainability in competitive online learning multi-agent systems","key":"ref15"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ICASSP40776.2020.9054699"},{"key":"ref17","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":"ref18","first-page":"6140","article-title":"Online convex optimization for cumulative constraints","author":"yuan","year":"2018","journal-title":"Proc of the 32nd Int Conf on neu Inf Process Sys"},{"year":"2016","author":"yu","article-title":"A Low Complexity Algorithm with $\\mathcal{O}(\\sqrt T )$ Regret and Finite Constraint Violations for Online Convex Optimization with Long Term Constraints","key":"ref19"},{"year":"2019","author":"tampubolon","article-title":"Robust online learning for resource allocation - beyond euclidean projection and dynamic fit","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/INFCOM.2011.5934885"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/s10107-007-0149-x"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TSTE.2013.2271517"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TSP.2017.2750109"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/9.182479"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/IGCC.2012.6322266"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/ISGT.2014.6816447"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/2487166.2487179"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/2208828.2208847"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/INFCOM.2012.6195799"},{"key":"ref1","first-page":"928","article-title":"Online Convex Programming and Generalized Infinitesimal Gradient Ascent","author":"zinkevich","year":"2003","journal-title":"Proceedings of the 20th International Conference on International Conference on Machine Learning"},{"key":"ref20","first-page":"569","article-title":"Online Learning with Sample Path Constraints","volume":"10","author":"mannor","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref22","first-page":"1427","article-title":"Online Convex Optimization with Stochastic Constraints","author":"yu","year":"2017","journal-title":"Proc of the 31st Int Conf on Neur Inf Process Sys"},{"key":"ref21","first-page":"402","article-title":"Adaptive Algorithms for Online Convex Optimization with Long-term Constraints","volume":"48","author":"jenatton","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/ICC.2018.8422560"},{"year":"2017","author":"neely","article-title":"Online Convex Optimization with Time-Varying Constraints","key":"ref23"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1137\/070704277"},{"key":"ref25","article-title":"Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints","author":"liakopoulos","year":"2019","journal-title":"ICML"}],"event":{"name":"ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2020,5,4]]},"location":"Barcelona, Spain","end":{"date-parts":[[2020,5,8]]}},"container-title":["ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9040208\/9052899\/09052961.pdf?arnumber=9052961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T20:28:10Z","timestamp":1656361690000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9052961\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/icassp40776.2020.9052961","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}