{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T02:57:59Z","timestamp":1730343479517,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.23919\/eusipco.2019.8903154","type":"proceedings-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T18:39:38Z","timestamp":1574707178000},"page":"1-5","source":"Crossref","is-referenced-by-count":4,"title":["FISTA: achieving a rate of convergence proportional to k<sup>-3<\/sup> for small\/medium values of k"],"prefix":"10.23919","author":[{"given":"Gustavo","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Rodriguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461884"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953315"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539957"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539958"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"8672","DOI":"10.1016\/j.amc.2012.02.029","article-title":"Two modifications of the method of the multiplicative parameters in descent gradient methods","volume":"218","author":"\u00f0ordevi?","year":"2012","journal-title":"Applied Mathematics and Computation"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013708715892"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/STSIVA.2019.8730236"},{"key":"ref34","article-title":"Efficient separable filter estimation using rank-1 convolutional dictionary learning","author":"silva","year":"2018","journal-title":"IEEE MLSP"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2028250"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/16M106340X"},{"journal-title":"Step-sizes for the gradient method","year":"2008","author":"yuan","key":"ref12"},{"journal-title":"Numerical Optimization","year":"2006","author":"nocedal","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9189-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1226-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2018.8553411"},{"key":"ref19","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":"Soviet Mathematics Doklady"},{"key":"ref28","article-title":"On the Suboptimality of Proximal Gradient Descent for ?0 Sparse Approximation","author":"yang","year":"2017","journal-title":"ArXiv e-prints"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0029-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953012"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.57"},{"journal-title":"Simulations for FISTA","year":"0","author":"rodriguez","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-5959-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2495260"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/050626090"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"ref20","first-page":"25","article-title":"On the convergence of the iterates of &#x201D;FISTA","volume":"166","author":"chambolle","year":"2015","journal-title":"J of Optimization Theory and Applications"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/15M1046095"},{"key":"ref21","first-page":"1","article-title":"A differential equation for modeling nesterov&#x2019;s accelerated gradient method: Theory and insights","volume":"17","author":"su","year":"2016","journal-title":"J of Machine Learning Research"},{"journal-title":"Gradient methods for minimizing composite objective function","year":"2007","author":"nesterov","key":"ref24"},{"key":"ref23","article-title":"Improving FISTA&#x2019;s speed of convergence via a novel inertial sequence","author":"rodriguez","year":"2019","journal-title":"European Signal Processing Conference (EUSIPCO)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2691661"},{"key":"ref25","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"tseng","year":"2008","journal-title":"SIAM J Optim submitted"}],"event":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","start":{"date-parts":[[2019,9,2]]},"location":"A Coruna, Spain","end":{"date-parts":[[2019,9,6]]}},"container-title":["2019 27th European Signal Processing Conference (EUSIPCO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8893974\/8902336\/08903154.pdf?arnumber=8903154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T20:55:53Z","timestamp":1604091353000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8903154\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":37,"URL":"https:\/\/doi.org\/10.23919\/eusipco.2019.8903154","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}