On performance of greedy algorithms
DOI10.1016/J.JAT.2011.03.009zbMATH Open1230.41005OpenAlexW2058891218MaRDI QIDQ719355FDOQ719355
Authors: V. N. Temlyakov, Pavel Zheltov 
Publication date: 10 October 2011
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2011.03.009
Recommendations
- scientific article; zbMATH DE number 3970528
- Some remarks on greedy algorithms
- Greedy in Approximation Algorithms
- scientific article; zbMATH DE number 169611
- A note on greedy algorithm
- Optimality of the greedy algorithm for some function classes
- The average performance of the greedy matching algorithm
- Some results on greedy algorithm conjectures
- The classification of greedy algorithms
coherencegreedy algorithmsparse representationorthogonal matching pursuit\(m\)-term approximationorthogonal greedy algorithmadditive-type Lebesgue inequalityincoherent dictionary
Approximation by other special function classes (41A30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Cites Work
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable recovery of sparse overcomplete representations in the presence of noise
- Projection pursuit
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Greed is Good: Algorithmic Results for Sparse Approximation
- Adaptive greedy approximations
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Two lower estimates in greedy approximation
- Some remarks on greedy algorithms
- Greedy approximation
- Sparse representations in unions of bases
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- On Lebesgue-type inequalities for greedy approximation
- Title not available (Why is that?)
Cited In (17)
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Lebesgue-type inequalities in greedy approximation
- Convergence almost everywhere of orthorecursive expansions in systems of translates and dilates
- Compression of Wannier functions into Gaussian-type orbitals
- On Lebesgue-type inequalities for greedy approximation
- Sparse approximation of individual functions
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
- Super greedy type algorithms
- Sparse approximation is provably hard under coherent dictionaries
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
- Quasi-linear compressed sensing
- On greedy algorithms for dictionaries with bounded cumulative coherence
- Greedy algorithms and approximation properties for frames in Hilbert spaces
- Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries
- Sparse approximation and recovery by greedy algorithms in Banach spaces
Uses Software
This page was built for publication: On performance of greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719355)
