On performance of greedy algorithms

DOI10.1016/J.JAT.2011.03.009MaRDI QIDQ719355zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

coherencegreedy algorithmsparse representationorthogonal matching pursuit\(m\)-term approximationorthogonal greedy algorithmadditive-type Lebesgue inequalityincoherent dictionary

Mathematics Subject Classification ID

Approximation by other special function classes (41A30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

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

Cites work

• scientific article; zbMATH DE number 2079345 (Why is no real title available?)
• Adaptive greedy approximations
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Greed is Good: Algorithmic Results for Sparse Approximation
• Greedy approximation
• On Lebesgue-type inequalities for greedy approximation
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Projection pursuit
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Some remarks on greedy algorithms
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Sparse representations in unions of bases
• Stable recovery of sparse overcomplete representations in the presence of noise
• Two lower estimates in greedy approximation
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

Cited in

(16)

• Sparse approximation and recovery by greedy algorithms in Banach spaces
• On optimal estimate of the block orthogonal greedy algorithm for g-frames
• Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms
• Super greedy type algorithms
• On Lebesgue-type inequalities for greedy approximation
• Approximately normalized iterative hard thresholding for nonlinear compressive sensing
• Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries
• Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
• Greedy algorithms and approximation properties for frames in Hilbert spaces
• On greedy algorithms for dictionaries with bounded cumulative coherence
• Compression of Wannier functions into Gaussian-type orbitals
• Sparse approximation is provably hard under coherent dictionaries
• Sparse approximation of individual functions
• Convergence almost everywhere of orthorecursive expansions in systems of translates and dilates
• Quasi-linear compressed sensing

Describes a project that uses

Uses Software

• CoSaMP

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)