Some remarks on greedy algorithms Academic Article

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.

authors

• Devore, Ronald

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

publisher

• Springer Nature  Publisher

published in

• Advances in Computational Mathematics  Journal

Digital Object Identifier (DOI)

• 10.1007/bf02124742

start page

• 173

end page

• 187

volume

• 5

issue

• 1

URL

• http://dx.doi.org/10.1007/bf02124742