Some remarks on greedy algorithms
- Additional Document Info
- View All
Estimates are given for the rate of approximation of a function by means of greedy algorithms. The estimates apply to approximation from an arbitrary dictionary of functions. Three greedy algorithms are discussed: the Pure Greedy Algorithm, an Orthogonal Greedy Algorithm, and a Relaxed Greedy Algorithm. © J.C. Baltzer AG, Science Publishers.
author list (cited authors)
DeVore, R. A., & Temlyakov, V. N.