Super greedy type algorithms

DOI10.1007/s10444-011-9220-5zbMath1258.41013arXiv1010.5423OpenAlexW2159665097MaRDI QIDQ1928073

Entao Liu, Vladimir N. Temlyakov

Publication date: 2 January 2013

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.5423

zbMATH Keywords

convergence ratethresholdingincoherent dictionarysuper greedy algorithms

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (2)

Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries ⋮ Efficiency of orthogonal super greedy algorithm under the restricted isometry property

Uses Software

• PDCO

Cites Work

• Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
• Nonlinear methods of approximation
• Some remarks on greedy algorithms
• Weak greedy algorithms
• On Lebesgue-type inequalities for greedy approximation
• Atomic Decomposition by Basis Pursuit
• Greedy approximation

This page was built for publication: Super greedy type algorithms