This article is cited in 9 papers

Rate of Convergence of Pure Greedy Algorithms

E. D. Livshits

M. V. Lomonosov Moscow State University

Abstract: This paper is devoted to the study of the rate of convergence of pure greedy algorithms in Hilbert space. We obtain upper bounds for the rate of convergence of pure greedy algorithms for functions from the class $A_{\alpha,\beta}(D)$.

UDC: 517.518.8

Received: 10.09.2003

DOI: 10.4213/mzm130

 English version: Mathematical Notes, 2004, 76:4, 497–510

Bibliographic databases:

• 
• 
• 
•