A fast iterative shrinkage-thresholding algorithm for linear inverse problems. We consider the class of iterative shrinkage-thresholding algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods, which can be viewed as an extension of the classical gradient algorithm, is attractive due to its simplicity and thus is adequate for solving large-scale problems even with dense matrix data. However, such methods are also known to converge quite slowly. In this paper we present a new fast iterative shrinkage-thresholding algorithm (FISTA) which preserves the computational simplicity of ISTA but with a global rate of convergence which is proven to be significantly better, both theoretically and practically. Initial promising numerical results for wavelet-based image deblurring demonstrate the capabilities of FISTA which is shown to be faster than ISTA by several orders of magnitude.
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Aravkin, Aleksandr Y.; Burke, James V.; Pillonetto, Gianluigi: Generalized system identification with stable spline kernels (2018)
- Blondel, Mathieu; Seki, Kazuhiro; Uehara, Kuniaki: Block coordinate descent algorithms for large-scale sparse multiclass classification (2013)
- Beck, Amir; Teboulle, Marc: A fast iterative shrinkage-thresholding algorithm for linear inverse problems (2009)