Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty

DOI10.1016/j.crma.2011.08.011zbMath1229.90114OpenAlexW1997471466MaRDI QIDQ650854

Mila Nikolova

Publication date: 7 December 2011

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2011.08.011

zbMATH Keywords

penaltyquadratic data-fidelity

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (1)

New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem

Cites Work

• Unnamed Item
• A unified approach to model selection and sparse recovery using regularized least squares
• Iterative thresholding for sparse approximations
• Just relax: convex programming methods for identifying sparse signals in noise
• Signal Reconstruction From Noisy Random Projections
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Ideal spatial adaptation by wavelet shrinkage
• Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
• Combined SVM-based feature selection and classification
• Adaptive greedy approximations

This page was built for publication: Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty