Some remarks on greedy algorithms
The authors develop estimates for the rate of approximation for certain classes of functions and study certain greedy algorithms. They restrict their study to the case where approximation takes place in a real, separable Hilbert space and study three greedy algorithms: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm.
scientific article; zbMATH DE number 934187