{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T07:08:02Z","timestamp":1768633682335,"version":"3.49.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.23919\/acc45564.2020.9147467","type":"proceedings-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T18:02:33Z","timestamp":1595872953000},"page":"2850-2857","source":"Crossref","is-referenced-by-count":10,"title":["Inexact Online Proximal-gradient Method for Time-varying Convex Optimization"],"prefix":"10.23919","author":[{"given":"Amirhossein","family":"Ajalloeian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Simonetto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emiliano","family":"Dall'Anese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032240"},{"key":"ref11","article-title":"Time-varying convex optimization via time-varying averaged operators","author":"simonetto","year":"2017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0396(77)90085-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2896112"},{"key":"ref14","first-page":"1167","article-title":"Inexact and accelerated proximal point algorithms","volume":"19","author":"salzo","year":"2012","journal-title":"Journal of Convex Analysis"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/110844805"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2018.12.040"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618731"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2896025"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619044"},{"key":"ref28","author":"hiriart-urruty","year":"1996","journal-title":"Convex Analysis and Minimization Algorithms II Advanced Theory and Bundle Methods"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329397"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1232-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2867589"},{"key":"ref29","first-page":"3","article-title":"Primer on monotone operator methods","volume":"15","author":"ryu","year":"2016","journal-title":"Comput Math Appl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2890368"},{"key":"ref8","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","author":"schmidt","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2011.5991020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10513-005-0132-z"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2839563"},{"key":"ref22","article-title":"Optimal computational trade-off of inexact proximal methods","author":"machart","year":"2012","journal-title":"arXiv preprint arXiv 1210 5034"},{"key":"ref21","first-page":"2","article-title":"Proximal methods for sparse hierarchical dictionary learning","volume":"1","author":"jenatton","year":"2010","journal-title":"ICML"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483273"},{"key":"ref26","first-page":"398","article-title":"Online Optimization: Competing with Dynamic Comparators","author":"jadbabaie","year":"2015","journal-title":"PMLR"},{"key":"ref25","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","author":"yang","year":"2016","journal-title":"International Conference on Machine Learning"}],"event":{"name":"2020 American Control Conference (ACC)","location":"Denver, CO, USA","start":{"date-parts":[[2020,7,1]]},"end":{"date-parts":[[2020,7,3]]}},"container-title":["2020 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9140048\/9147203\/09147467.pdf?arnumber=9147467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T17:47:35Z","timestamp":1598896055000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9147467\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":29,"URL":"https:\/\/doi.org\/10.23919\/acc45564.2020.9147467","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}