Necessary and sufficient conditions for linear convergence of ℓ1-regularization

DOI10.1002/cpa.20350zbMath1217.65095OpenAlexW4252317729MaRDI QIDQ3068374

Markus Grasmair, Markus Haltmeier, Otmar Scherzer

Publication date: 14 January 2011

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cpa.20350

zbMATH Keywords

inverse problem Tikhonov regularization ill-posed problems sparse compressed sensing linear convergence rates

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (48)

One condition for solution uniqueness and robustness of both $\ell_1$-synthesis and $\ell_1$-analysis minimizations ⋮ Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT ⋮ Convergence rates for the joint solution of inverse problems with compressed sensing data ⋮ Sensitivity Analysis for Mirror-Stratifiable Convex Functions ⋮ On ℓ 1 -Regularization Under Continuity of the Forward Operator in Weaker Topologies ⋮ Regularized sparse representation for image deconvolution ⋮ Shearlet-based regularization in statistical inverse learning with an application to x-ray tomography ⋮ Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem ⋮ Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE ⋮ Adaptive multi-penalty regularization based on a generalized Lasso path ⋮ Quadratic growth conditions and uniqueness of optimal solution to Lasso ⋮ Exact support recovery for sparse spikes deconvolution ⋮ Optimal dual certificates for noise robustness bounds in compressive sensing ⋮ Weighted sparsity regularization for source identification for elliptic PDEs ⋮ Uncertainty Principles for Inverse Source Problems, Far Field Splitting, and Data Completion ⋮ NETT: solving inverse problems with deep neural networks ⋮ The residual method for regularizing ill-posed problems ⋮ Efficient regularization with wavelet sparsity constraints in photoacoustic tomography ⋮ Geometric properties of solutions to the total variation denoising problem ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ Compressive time-of-flight 3D imaging using block-structured sensing matrices ⋮ Optimal convergence rates for sparsity promoting wavelet-regularization in Besov spaces ⋮ Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization ⋮ Consistency of $\ell_1$ recovery from noisy deterministic measurements ⋮ Oscillation of metropolis-Hastings and simulated annealing algorithms around LASSO estimator ⋮ Deep synthesis network for regularizing inverse problems ⋮ On uniqueness guarantees of solution in convex regularized linear inverse problems ⋮ On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery ⋮ Injectivity and $\text{weak}^\star$-to-weak continuity suffice for convergence rates in $\ell^{1}$-regularization ⋮ Sparse signal inversion with impulsive noise by dual spectral projected gradient method ⋮ An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices ⋮ An introduction to continuous optimization for imaging ⋮ Necessary and sufficient conditions of solution uniqueness in 1-norm minimization ⋮ Improved bounds for restricted isometry constants ⋮ Far Field Splitting by Iteratively Reweighted $\ell^1$ Minimization ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Sparse Regularization of Inverse Problems by Operator-Adapted Frame Thresholding ⋮ Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction ⋮ Maximal spaces for approximation rates in $\ell^1$-regularization ⋮ Convergence rates inℓ¹-regularization when the basis is not smooth enough ⋮ Modern regularization methods for inverse problems ⋮ Infinite-dimensional inverse problems with finite measurements ⋮ Smoothing Newton method for $\ell^0$-$\ell^2$ regularized linear inverse problem ⋮ Variational regularization theory based on image space approximation rates ⋮ Multiscale Factorization of the Wave Equation with Application to Compressed Sensing Photoacoustic Tomography ⋮ Regularization of inverse problems by filtered diagonal frame decomposition ⋮ Solving Basis Pursuit ⋮ Empirical average-case relation between undersampling and sparsity in X-ray CT

Cites Work

This page was built for publication: Necessary and sufficient conditions for linear convergence of ℓ1-regularization