Journal
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS
Volume 14, Issue 5-6, Pages 813-837Publisher
SPRINGER
DOI: 10.1007/s00041-008-9041-1
Keywords
Iterative soft-thresholding; Inverse problems; Sparsity constraints; Convergence analysis; Generalized gradient projection method
Categories
Ask authors/readers for more resources
In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized gradient methods and present a new convergence analysis. As main result we show that the algorithm converges with linear rate as soon as the underlying operator satisfies the so-called finite basis injectivity property or the minimizer possesses a so-called strict sparsity pattern. Moreover it is shown that the constants can be calculated explicitly in special cases (i.e. for compact operators). Furthermore, the techniques also can be used to establish linear convergence for related methods such as the iterative thresholding algorithm for joint sparsity and the accelerated gradient projection method.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available