Linear convergence of iterative soft-thresholding

Abstract

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.

References in corpus (3)

• Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints
• Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
• A Semismooth Newton Method for Tikhonov Functionals with Sparsity Constraints

Cited by in corpus (26)

• Generalized Forward-Backward Splitting
• $L_{1/2}$ Regularization: Convergence of Iterative Half Thresholding Algorithm
• Variable metric inexact line-search based methods for nonsmooth optimization
• Elastic-Net Regularization: Error estimates and Active Set Methods
• Dynamic Filtering of Time-Varying Sparse Signals via l1 Minimization
• Heuristic parameter-choice rules for convex variational regularization based on error estimates
• Discrete and Continuous-time Soft-Thresholding with Dynamic Inputs
• Orthonormal Expansion l1-Minimization Algorithms for Compressed Sensing
• Hybrid ISTA: Unfolding ISTA With Convergence Guarantees Using Free-Form Deep Neural Networks
• Morozov's principle for the augmented Lagrangian method applied to linear inverse problems
• Limitations of Deep Learning for Inverse Problems on Digital Hardware
• CSC-Unet: A Novel Convolutional Sparse Coding Strategy Based Neural Network for Semantic Segmentation
• Norm-1 Regularized Consensus-based ADMM for Imaging with a Compressive Antenna
• IMRO: a proximal quasi-Newton method for solving $l_1$-regularized least square problem
• A differential equations approach to $l_1$-minimization with applications to array imaging
• Local and Global Convergence of a General Inertial Proximal Splitting Scheme
• Convergence of the Forward-Backward Algorithm: Beyond the Worst Case with the Help of Geometry
• Optimal convergence rates for sparsity promoting wavelet-regularization in Besov spaces
• Flexible sparse regularization
• Joint super-resolution image reconstruction and parameter identification in imaging operator: Analysis of bilinear operator equations, numerical solution, and application to magnetic particle imaging
• Efficient Dictionary Learning with Sparseness-Enforcing Projections
• Beyond convergence rates: Exact recovery with Tikhonov regularization with sparsity constraints
• Sparse online variational Bayesian regression
• A note on the minimization of a Tikhonov functional with ${\ell }^1$-penalty
• Sparse Multiple Kernel Learning: Support Identification via Mirror Stratifiability
• A projection proximal-point algorithm for l^1-minimization