{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:56:03Z","timestamp":1729659363831,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1109\/icassp.2017.7953012","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:35:36Z","timestamp":1497980136000},"page":"4521-4525","source":"Crossref","is-referenced-by-count":12,"title":["A robust FISTA-like algorithm"],"prefix":"10.1109","author":[{"given":"Mihai I.","family":"Florea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiy A.","family":"Vorobyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref11","article-title":"Gradient methods for minimizing composite objective function","author":"nesterov","year":"2007","journal-title":"CORE Universit&#x00E9; Catholique de Louvain Tech Rep 76"},{"journal-title":"An accelerated composite gradient method for large-scale composite objective problems","year":"2016","author":"florea","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178681"},{"key":"ref14","first-page":"2510","article-title":"A differential equation for modeling Nesterov's accelerated gradient method: Theory and insights","author":"su","year":"2014","journal-title":"Advances in Neural Inform Process Syst 27 Montr&#x00E9;al Canada"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718874"},{"journal-title":"On Algorithms for Non Convex Optimization","year":"2015","author":"bertsekas","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403427823"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0029-5"},{"journal-title":"submitted to SIAM J Optim","year":"2008","author":"tseng","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0261-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9150-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0746-4"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume":"87","author":"nesterov","year":"2004","journal-title":"Introductory lectures on convex optimization Applied optimization"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S096249291600009X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"}],"event":{"name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2017,3,5]]},"location":"New Orleans, LA","end":{"date-parts":[[2017,3,9]]}},"container-title":["2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7943262\/7951776\/07953012.pdf?arnumber=7953012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T07:22:56Z","timestamp":1569482576000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7953012\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icassp.2017.7953012","relation":{},"subject":[],"published":{"date-parts":[[2017,3]]}}}