This article is cited in 6 scientific papers (total in 6 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)$ .
Received: 10.09.2003
Citation:
E. D. Livshits, “Rate of Convergence of Pure Greedy Algorithms”, Mat. Zametki , 76 :4 (2004), 539–552 ; Math. Notes , 76 :4 (2004), 497–510
Linking options:
https://www.mathnet.ru/eng/mzm130 https://doi.org/10.4213/mzm130 https://www.mathnet.ru/eng/mzm/v76/i4/p539
6
CITATIONS
6
Total citations
0
Recent citations
2.1
Field Citation Ratio
n/a
Relative Citation Ratio
8
CITATIONS
8
Total citations
0
Recent citations
1.65
Field Citation Ratio
n/a
Relative Citation Ratio
Statistics & downloads :
Abstract page: 451 Full-text PDF : 230 References: 59 First page: 1