Abstract

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

DeblurringThresholdingAlgorithmRate of convergenceShrinkageInverse problemMathematicsWaveletIterative methodImage (mathematics)Image processingInverseSimplicityComputer scienceMathematical optimizationApplied mathematicsImage restorationArtificial intelligenceMathematical analysis

Affiliated Institutions

Related Publications

Publication Info

Year
2009
Type
article
Volume
2
Issue
1
Pages
183-202
Citations
11634
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

11634
OpenAlex

Cite This

Amir Beck, Marc Teboulle (2009). A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems. SIAM Journal on Imaging Sciences , 2 (1) , 183-202. https://doi.org/10.1137/080716542

Identifiers

DOI
10.1137/080716542