On Lebesgue-type inequalities for greedy approximation

DOI10.1016/j.jat.2007.01.004zbMath1120.41007OpenAlexW2039919879MaRDI QIDQ2643860

David L. Donoho, Michael Elad, Vladimir N. Temlyakov

Publication date: 27 August 2007

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2007.01.004

zbMATH Keywords

coherencegreedy algorithmLebesgue inequalitydictionary

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Approximation by polynomials (41A10)

Related Items

Lebesgue-type inequalities in greedy approximation, Frames and non linear approximations in Hilbert spaces, Sparse approximation is provably hard under coherent dictionaries, Super greedy type algorithms, Error estimates for orthogonal matching pursuit and random dictionaries, On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries, Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions, Explicit constructions of RIP matrices and related problems, Existence of the best \(n\)-term approximants for structured dictionaries, A note on the hardness of sparse approximation, On performance of greedy algorithms, On the size of incoherent systems, On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Theoretical guarantees for graph sparse coding, Unnamed Item, SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES

Cites Work

• Unnamed Item
• Unnamed Item
• Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
• Nonlinear methods of approximation
• Some remarks on greedy algorithms
• Weak greedy algorithms
• Greed is Good: Algorithmic Results for Sparse Approximation