Convergence rates and source conditions for Tikhonov regularization with sparsity constraints

Abstract

This paper addresses the regularization by sparsity constraints by means of weighted ${\ell }^p$ penalties for $0\le p\le 2$. For $1\le p\le 2$ special attention is payed to convergence rates in norm and to source conditions. As main result it is proven that one gets a convergence rate in norm of $\sqrt{\delta }$ for $1\le p\le 2$ as soon as the unknown solution is sparse. The case $p=1$ needs a special technique where not only Bregman distances but also a so-called Bregman-Taylor distance has to be employed. For $p<1$ only preliminary results are shown. These results indicate that, different from $p\ge 1$, the regularizing properties depend on the interplay of the operator and the basis of sparsity. A counterexample for $p=0$ shows that regularization need not to happen.

References in corpus (1)

• A Semismooth Newton Method for Tikhonov Functionals with Sparsity Constraints

Cited by in corpus (40)

• Linear convergence of iterative soft-thresholding
• Sparse Regularization with $l^q$ Penalty Term
• Greedy Solution of Ill-Posed Problems: Error Bounds and Exact Inversion
• Elastic-Net Regularization: Error estimates and Active Set Methods
• Heuristic parameter-choice rules for convex variational regularization based on error estimates
• The Residual Method for Regularizing Ill-Posed Problems
• Tikhonov regularization with oversmoothing penalty for non-linear ill-posed problems in Hilbert scales
• Necessary conditions for variational regularization schemes
• Convergence rates in ${\mathbf{\ell }}^1$-regularization if the sparsity assumption fails
• Morozov's principle for the augmented Lagrangian method applied to linear inverse problems
• Optimal Convergence Rates for Tikhonov Regularization in Besov Scales
• Shrinkage Rules for Variational Minimization Problems and Applications to Analytical Ultracentrifugation
• On the interplay of basis smoothness and specific range conditions occurring in sparsity regularization
• Elastic-net regularization versus ${\ell }^1$-regularization for linear inverse problems with quasi-sparse solutions
• Flexible sparse regularization
• Optimal convergence rates for sparsity promoting wavelet-regularization in Besov spaces
• On ${\ell }^1$-regularization in light of Nashed's ill-posedness concept
• A unified approach to convergence rates for ${\ell }^1$-regularization and lacking sparsity
• Robust Sparse Analysis Regularization
• Beyond convergence rates: Exact recovery with Tikhonov regularization with sparsity constraints
• Parameter Choices for Sparse Regularization with the ${\ell }_1$ Norm
• Translation invariant diagonal frame decomposition of inverse problems and their regularization
• Constructing test instances for Basis Pursuit Denoising
• A global minimization algorithm for Tikhonov functionals with sparsity constraints
• Convergence rates for the joint solution of inverse problems with compressed sensing data
• Shearlet-based regularization in statistical inverse learning with an application to X-ray tomography
• Efficient regularization with wavelet sparsity constraints in PAT
• Regularization with optimal space-time priors
• Convergence rates in ${\ell }^1$-regularization when the basis is not smooth enough
• Injectivity and weak*-to-weak continuity suffice for convergence rates in ${\ell }^1$-regularization
• New Pair of Primal Dual Algorithms for Bregman Iterated Variational Regularization
• Fast Fourier-Based Generation of the Compression Matrix for Deterministic Compressed Sensing
• Case studies and a pitfall for nonlinear variational regularization under conditional stability
• Generalized Variational Source Condition Associated with the Bregman Distance-I: Verification of the Variational Source Condition and Stability of the Total Error Estimation
• Variational Convergence Analysis With Smoothed-TV Interpretation
• Smoothed-TV Regularization for Hölder Continuous Functions
• Convergence analysis in convex regularization depending on the smoothness degree of the penalizer
• Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces
• Tikhonov functionals with a tolerance measure introduced in the regularization
• Tikhonov regularization with l^0-term complementing a convex penalty: l^1 convergence under sparsity constraints