Some remarks on greedy algorithms Academic Article uri icon

abstract

  • 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.

published proceedings

  • Advances in Computational Mathematics

altmetric score

  • 6

author list (cited authors)

  • DeVore, R. A., & Temlyakov, V. N.

citation count

  • 335

complete list of authors

  • DeVore, RA||Temlyakov, VN

publication date

  • January 1996