On performance of greedy algorithms

DOI10.1016/j.jat.2011.03.009zbMath1230.41005OpenAlexW2058891218MaRDI QIDQ719355

Vladimir 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 algorithm\(m\)-term approximationsparse representationorthogonal matching pursuitorthogonal greedy algorithmadditive-type Lebesgue inequalityincoherent dictionary

Mathematics Subject Classification ID

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

Related Items

Lebesgue-type inequalities in greedy approximation, Sparse approximation is provably hard under coherent dictionaries, Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries, On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries, Sparse approximation of individual functions, Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms, Approximately normalized iterative hard thresholding for nonlinear compressive sensing, On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames, Convergence Almost Everywhere of Orthorecursive Expansions in Systems of Translates and Dilates, Quasi-linear Compressed Sensing, Unnamed Item, Compression of Wannier functions into Gaussian-type orbitals, SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES

Uses Software

• CoSaMP

Cites Work

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