Accelerated projected gradient method for linear inverse problems with sparsity constraints

From MaRDI portal
Revision as of 10:19, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:734949

DOI10.1007/S00041-008-9039-8zbMath1175.65062arXiv0706.4297OpenAlexW3103184409MaRDI QIDQ734949

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)

Full work available at URL: https://arxiv.org/abs/0706.4297




Related Items (37)

Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rulesAn efficient projection method for nonlinear inverse problems with sparsity constraintsScore test variable screeningAdaptively relaxed algorithms for solving the split feasibility problem with a new step sizeIsotropic sparse regularization for spherical harmonic representations of random fields on the sphereGeneralized conditional gradient method for elastic-net regularizationNonlinear multilayered representation of graph-signalsPolyak's gradient method for split feasibility problem constrained by level setsParametric identification problem with a regularizer in the form of the total variation of the controlA smoothing projected HS method for solving stochastic tensor complementarity problemConvergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problemsOn vector and matrix median computationA predictor-corrector iterated Tikhonov regularization for linear ill-posed inverse problemsA consistent algorithm to solve Lasso, elastic-net and Tikhonov regularizationProjected gradient iteration for nonlinear operator equationLorentz force eddy current testing: a novel NDE-techniqueInversion of the noisy Radon transform on SO(3) by Gabor frames and sparse recovery principlesProximal methods for the latent group lasso penaltyNonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensingA projected gradient method for αℓ 1 − βℓ 2 sparsity regularization **Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensingHomogeneous penalizers and constraints in convex image restorationConvergence of projected Landweber iteration for matrix rank minimizationNon-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensingGradient iteration with \(\ell _{p}\)-norm constraintsUnnamed ItemProjected Landweber iteration for matrix completionL1Packv2: A Mathematica package for minimizing an \(\ell _{1}\)-penalized functionalAn Iterative Algorithm with Joint Sparsity Constraints for Magnetic TomographyAn iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach spaceThe stochastic properties of \(\ell^1\)-regularized spherical Gaussian fieldsElastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of SolutionsAn analysis of a multi-level projected steepest descent iteration for nonlinear inverse problems in Banach spaces subject to stability constraintsLinear convergence of iterative soft-thresholdingSplit Feasibility and Fixed Point ProblemsUnbiasing in iterative reconstruction algorithms for discrete compressed sensingNew generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem


Uses Software



Cites Work




This page was built for publication: Accelerated projected gradient method for linear inverse problems with sparsity constraints