Average performance of the approximation in a dictionary using an \(\ell _0\) objective
From MaRDI portal
Publication:1018130
DOI10.1016/j.crma.2009.02.026zbMath1163.65041MaRDI QIDQ1018130
François Malgouyres, Mila Nikolova
Publication date: 13 May 2009
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.2009.02.026
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
68P05: Data structures
65Y20: Complexity and performance of numerical algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Rank related properties for basis pursuit and total variation regularization
- Average Performance of the Sparsest Approximation Using a General Dictionary
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Adaptive greedy approximations