{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:56:19Z","timestamp":1770753379175,"version":"3.50.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.23919\/eusipco.2017.8081184","type":"proceedings-article","created":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T17:20:38Z","timestamp":1509643238000},"page":"136-140","source":"Crossref","is-referenced-by-count":6,"title":["Online convex optimization for dynamic network resource allocation"],"prefix":"10.23919","author":[{"given":"Tianyi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios B.","family":"Giannakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2200\/S00271ED1V01Y201006CNT007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2636210"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2378871"},{"key":"ref13","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2679690"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2539948"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref6","article-title":"Online optimization: Competing with dynamic comparators","author":"jadbabaie","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2449255"},{"key":"ref7","first-page":"2503","article-title":"Trading regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"mahdavi","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref2","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc 7th Int Conf Machine Learning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref9","author":"shahrampour","year":"2016","journal-title":"Distributed online optimization in dynamic environments using mirror descent"}],"event":{"name":"2017 25th European Signal Processing Conference (EUSIPCO)","location":"Kos, Greece","start":{"date-parts":[[2017,8,28]]},"end":{"date-parts":[[2017,9,2]]}},"container-title":["2017 25th European Signal Processing Conference (EUSIPCO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8067434\/8081145\/08081184.pdf?arnumber=8081184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,30]],"date-time":"2017-11-30T15:19:22Z","timestamp":1512055162000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8081184\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":15,"URL":"https:\/\/doi.org\/10.23919\/eusipco.2017.8081184","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}