Linear convergence of iterative soft-thresholding

Details Linear convergence of iterative soft-thresholding Linear convergence of iterative soft-thresholding

2007-09-11

arxiv.org/abs/0709.1598v4

Journal of Fourier Analysis and Applications, 14(5-6):813-837, 2008

Mathematics

Functional Analysis

Scientific paper

10.1007/s00041-008-9041-1

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.

Affiliated with

Also associated with

No associations

Rating

Linear convergence of iterative soft-thresholding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear convergence of iterative soft-thresholding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear convergence of iterative soft-thresholding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392280