|
|||||
|
|
Rate of Convergence of Pure Greedy Algorithms |
|
| Authors: | Livshits E. D. |
| Affiliation: | 1. M. V. Lomonosov Moscow State University, russia |
| 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 α, β(D). |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |