Accelerated projected gradient method for linear inverse problems with sparsity constraints
From MaRDI portal
Publication:734949
DOI10.1007/S00041-008-9039-8zbMATH Open1175.65062arXiv0706.4297OpenAlexW3103184409MaRDI QIDQ734949FDOQ734949
Authors: Ingrid Daubechies, Massimo Fornasier, Ignace Loris 
Publication date: 14 October 2009
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Abstract: Regularization of ill-posed linear inverse problems via penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to -constraints, using a gradient method, with projection on -balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of the (linear) steepest descent method. We prove convergence in norm for one of these projected gradient methods, without and with acceleration.
Full work available at URL: https://arxiv.org/abs/0706.4297
Recommendations
- Accelerated projected steepest descent method for nonlinear inverse problems with sparsity constraints
- An efficient projection method for nonlinear inverse problems with sparsity constraints
- The alternating descent conditional gradient method for sparse inverse problems
- On the acceleration of optimal regularization algorithms for linear ill-posed inverse problems
- Conjugate gradient based acceleration for inverse problems
- Alternating direction method of multipliers for linear inverse problems
- Inverse problems with sparsity constraints: Convergence rates and exact recovery
- Optimized sparse approximate inverse smoothers for solving Laplacian linear systems
- Stable gradient projection method for nonlinear conditionally well-posed inverse problems
convergencenumerical examplesalgorithmgradient methoditerative methodsteepest descent methodill-posed linear inverse problems
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Ill-posedness and regularization problems in numerical linear algebra (65F22) Inverse problems in linear algebra (15A29) Convex functions and convex programs in convex geometry (52A41) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22) Linear operators and ill-posed problems, regularization (47A52) Numerical solutions to equations with linear operators (65J10)
Cites Work
- Least angle regression. (With discussion)
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nonlinear solution of linear inverse problems by wavelet-vaguelette decomposition
- Ten Lectures on Wavelets
- Title not available (Why is that?)
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- De-noising by soft-thresholding
- Signal Recovery by Proximal Forward-Backward Splitting
- An EM algorithm for wavelet-based image restoration
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Title not available (Why is that?)
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- An introduction to frames and Riesz bases
- Adaptive wavelet methods. II: Beyond the elliptic case
- Uncertainty Principles and Signal Recovery
- Title not available (Why is that?)
- Adaptive wavelet methods for elliptic operator equations: Convergence rates
- Adaptive frame methods for elliptic operator equations: the steepest descent approach
- Superresolution via Sparsity Constraints
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- Adaptive frame methods for elliptic operator equations
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Adaptive Wavelet Galerkin Methods for Linear Inverse Problems
- Domain decomposition methods for linear inverse problems with sparsity constraints
- Tikhonov replacement functionals for iteratively solving nonlinear operator equations
- Random sampling of sparse trigonometric polynomials
- Multi-frame representations in linear inverse problems with mixed multi-constraints
- Iterative thresholding algorithms
- Adaptive Optimization of Convex Functionals in Banach Spaces
- Variational image restoration by means of wavelets: Simultaneous decomposition, deblurring, and denoising
- Wavelets and curvelets for image deconvolution: a combined approach
- Signal Recovery and the Large Sieve
- Gray and color image contrast enhancement by the curvelet transform
- Title not available (Why is that?)
- Adaptive iterative thresholding algorithms for magnetoencephalography (MEG)
Cited In (51)
- A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
- An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
- Sparse signal inversion with impulsive noise by dual spectral projected gradient method
- An analysis of a multi-level projected steepest descent iteration for nonlinear inverse problems in Banach spaces subject to stability constraints
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Lorentz force eddy current testing: a novel NDE-technique
- Cardinality minimization, constraints, and regularization: a survey
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- A smoothing projected HS method for solving stochastic tensor complementarity problem
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- Convergence of projected Landweber iteration for matrix rank minimization
- Split feasibility and fixed point problems
- A projected gradient method for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
- An iterative algorithm with joint sparsity constraints for magnetic tomography
- On the convergence rate of projected gradient descent for a back-projection based objective
- Proximal methods for the latent group lasso penalty
- An efficient projection method for nonlinear inverse problems with sparsity constraints
- Accelerated projected steepest descent method for nonlinear inverse problems with sparsity constraints
- Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
- The stochastic properties of \(\ell^1\)-regularized spherical Gaussian fields
- Projected Landweber iteration for matrix completion
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
- A predictor-corrector iterated Tikhonov regularization for linear ill-posed inverse problems
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- Generalized conditional gradient method for elastic-net regularization
- Gradient iteration with \(\ell _{p}\)-norm constraints
- L1Packv2: A Mathematica package for minimizing an \(\ell _{1}\)-penalized functional
- Projected gradient iteration for nonlinear operator equation
- Projected Newton method for noise constrained \(\ell_p\) regularization
- Polyak's gradient method for split feasibility problem constrained by level sets
- Inversion of the noisy Radon transform on SO(3) by Gabor frames and sparse recovery principles
- On vector and matrix median computation
- Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems
- Title not available (Why is that?)
- Linear convergence of iterative soft-thresholding
- Score test variable screening
- A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
- Homogeneous penalizers and constraints in convex image restoration
- On the role of sparsity in inverse problems
- Identification of sparsely representable diffusion parameters in elliptic problems
- Title not available (Why is that?)
- Nonlinear multilayered representation of graph-signals
- Parametric identification problem with a regularizer in the form of the total variation of the control
Uses Software
This page was built for publication: Accelerated projected gradient method for linear inverse problems with sparsity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734949)
