{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:22:12Z","timestamp":1771474932415,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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":[[2019,12]]},"DOI":"10.1109\/cdc40024.2019.9029983","type":"proceedings-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T04:43:11Z","timestamp":1584074591000},"page":"3936-3941","source":"Crossref","is-referenced-by-count":9,"title":["Gradient Based Restart FISTA"],"prefix":"10.1109","author":[{"given":"Teodoro","family":"Alamo","sequence":"first","affiliation":[]},{"given":"Pablo","family":"Krupa","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Limon","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"tseng","year":"2008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-IT-1002.03322"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2176389"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2018.8550126"},{"key":"ref14","first-page":"1","article-title":"Adaptive restart for accelerated gradient schemes","author":"o\u2019donoghue","year":"2013","journal-title":"Foundations of Computational Mathematics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2013.6669122"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7040179"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1287-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref19","first-page":"123","article-title":"Proximal algorithms","volume":"1","author":"parikh","year":"2013","journal-title":"Foundations and Trends in Optimization"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2564160"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref8","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Sov Math Dokl"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2808442"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2019.8795831"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref1","first-page":"1","article-title":"Linear convergence of first order methods for non-strongly convex optimization","author":"necoara","year":"2018","journal-title":"Mathematical Programming"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","author":"bauschke","year":"2011","journal-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974997","author":"beck","year":"2017","journal-title":"First Order Optimization Method"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02096261"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2019.8795831"},{"key":"ref26","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref25","first-page":"15231548","article-title":"Iteration complexity of feasible descent methods for convex optimization","volume":"15","author":"wang","year":"2014","journal-title":"Journal of Machine Learning Research"}],"event":{"name":"2019 IEEE 58th Conference on Decision and Control (CDC)","location":"Nice, France","start":{"date-parts":[[2019,12,11]]},"end":{"date-parts":[[2019,12,13]]}},"container-title":["2019 IEEE 58th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977134\/9028853\/09029983.pdf?arnumber=9029983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:25:47Z","timestamp":1658262347000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9029983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cdc40024.2019.9029983","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}