On Lebesgue-type inequalities for greedy approximation
Lebesgue proved an inequality that relates the error of a particular method of approximation by the trigonometric polynomials of order n to the best possible error of approximation by the trigonometric polynomials of order n. In the case of approximation with regard to bases, the Lebesgue-type inequalities are known both in linear and in nonlinear settings. In this paper, the authors describe a pure greedy algorithm for a general dictionary. A general Lebesgue-type inequality for the pure greedy algorithm with regard to a m-coherent dictionary is proved, and an analogous inequality is established for the orthogonal greedy algorithm.
- Greed is Good: Algorithmic Results for Sparse Approximation
- Greedy algorithms and M-term approximation with regard to redundant dictionaries
- scientific article; zbMATH DE number 2016952 (Why is no real title available?)
- scientific article; zbMATH DE number 2079345 (Why is no real title available?)
- Nonlinear methods of approximation
- Some remarks on greedy algorithms
- Weak greedy algorithms
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Lebesgue inequalities for the greedy algorithm in general bases
- Super greedy type algorithms
- A note on the hardness of sparse approximation
- Frames and non linear approximations in Hilbert spaces
- Sparse approximation and recovery by greedy algorithms in Banach spaces
- Lebesgue-type inequalities for greedy approximation with respect to quasi-greedy bases
- Quasi-greedy bases and Lebesgue-type inequalities
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Sparse approximation is provably hard under coherent dictionaries
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
- Existence of the best \(n\)-term approximants for structured dictionaries
- Sparse approximation by greedy algorithms
- Greedy algorithms and approximation properties for frames in Hilbert spaces
- scientific article; zbMATH DE number 5024023 (Why is no real title available?)
- Error estimates for orthogonal matching pursuit and random dictionaries
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
- Explicit constructions of RIP matrices and related problems
- On performance of greedy algorithms
- On the size of incoherent systems
- Sparse sampling recovery by greedy algorithms
- Theoretical guarantees for graph sparse coding
This page was built for publication: On Lebesgue-type inequalities for greedy approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643860)
