On the performance of algorithms for the minimization of ℓ 1 -penalized functionals

DOI10.1088/0266-5611/25/3/035008zbMath1162.65333arXiv0710.4082OpenAlexW2028452438MaRDI QIDQ3616366

Ignace Loris

Publication date: 25 March 2009

Published in: Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsnumerical examplesill-conditioned problemslinear inverse problemsiterative minimizationleast-squares functional

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Complexity and performance of numerical algorithms (65Y20)

Related Items

Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules ⋮ A Survey of Compressed Sensing ⋮ Nonlinear regularization techniques for seismic tomography ⋮ Convex optimization approach to signals with fast varying instantaneous frequency ⋮ Bregmanized domain decomposition for image restoration ⋮ Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO ⋮ L1Packv2: A Mathematica package for minimizing an \(\ell _{1}\)-penalized functional ⋮ Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions ⋮ Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions ⋮ Elastic-net regularization for nonlinear electrical impedance tomography with a splitting approach