{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:12:56Z","timestamp":1775229176607,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"24","license":[{"start":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T00:00:00Z","timestamp":1513296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1509040"],"award-info":[{"award-number":["1509040"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1508993"],"award-info":[{"award-number":["1508993"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1509005"],"award-info":[{"award-number":["1509005"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation China","award":["61573331"],"award-info":[{"award-number":["61573331"]}]},{"name":"National Science Foundation Anhui","award":["1608085QF130"],"award-info":[{"award-number":["1608085QF130"]}]},{"name":"National Science Foundation Anhui","award":["CAS-XDA06040602"],"award-info":[{"award-number":["CAS-XDA06040602"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2017,12,15]]},"DOI":"10.1109\/tsp.2017.2750109","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T19:48:25Z","timestamp":1504813705000},"page":"6350-6364","source":"Crossref","is-referenced-by-count":193,"title":["An Online Convex Optimization Approach to Proactive Network Resource Allocation"],"prefix":"10.1109","volume":"65","author":[{"given":"Tianyi","family":"Chen","sequence":"first","affiliation":[]},{"given":"Qing","family":"Ling","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8264-6056","authenticated-orcid":false,"given":"Georgios B.","family":"Giannakis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2539948"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.3.383"},{"key":"ref33","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2569604"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2571982"},{"key":"ref30","article-title":"Resource-performance trade-off analysis for\n mobile robots","author":"svorenova","year":"2016"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2057247"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2500189"},{"key":"ref34","first-page":"943","article-title":"Improved strongly adaptive online\n learning using coin betting","author":"jun","year":"2017","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901464"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2257911"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465533"},{"key":"ref12","first-page":"2503","article-title":"Trading\n regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"mahdavi","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref13","article-title":"A low complexity algorithm with $ \\mathcal {O}(\\sqrt{T})$\n regret and constraint violations for online convex optimization with long term constraints","author":"yu","year":"2016"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2627401"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref16","first-page":"1119","article-title":"Online alternating direction method","author":"wang","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/90.811451"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831346"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/110836043"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2679690"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"ref8","first-page":"398","article-title":"Online optimization:\n Competing with dynamic comparators","author":"jadbabaie","year":"2015","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref2","article-title":"Online convex programming and generalized infinitesimal gradient\n ascent","author":"zinkevich","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref1","first-page":"146","article-title":"Online convex optimization for dynamic network resource allocation","author":"chen","year":"2017","journal-title":"Proc Eur Signal Process Conf"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2278149"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2253218"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2309751"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2460749"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref41","article-title":"Midcontinent independent system operator (MISO) locational marginal price","year":"2016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2525618"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2195732"},{"key":"ref43","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2200\/S00271ED1V01Y201006CNT007"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8081872\/08027140.pdf?arnumber=8027140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:04:37Z","timestamp":1642003477000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8027140\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,15]]},"references-count":43,"journal-issue":{"issue":"24"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2017.2750109","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,15]]}}}