A counter-example to the general convergence of partially greedy algorithms

DOI10.1006/jath.2001.3566zbMath0991.65014OpenAlexW2049600182MaRDI QIDQ5944137

Rémi Gribonval

Publication date: 19 August 2002

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00576644/file/vwga.pdf

zbMATH Keywords

convergenceexpansionHilbert spacegreedy algorithmcounter exampleiterative processesredundant dictionary

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)

Cites Work

• Projection pursuit
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Matching pursuit: Adaptive representations of images and sounds
• Some remarks on greedy algorithms
• Weak greedy algorithms
• Remarks on projection pursuit regression and density estimation
• Matching pursuits with time-frequency dictionaries
• Fast matching pursuit with a multiscale dictionary of Gaussian chirps

This page was built for publication: A counter-example to the general convergence of partially greedy algorithms