Two Lower Estimates in Greedy Approximation

Constructive Approximation

Volumn 19, Issue 4, 2003, Pages 509-523

  Livshitz, E D ^a   Temlyakov, V N ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

General dictionary; Greedy algorithm; Hubert space; Lower estimate; Rate of convergence

Indexed keywords

EID: 0242266071     PISSN: 01764276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00365-003-0533-6     Document Type: Article

References (7)

1. R. A. DEVORE, V. N. TEMLYAKOV (1996): Some remarks on greedy algorithms. Adv. in Comput. Math., 5:173-187.
2. L. JONES (1987): On a conjecture of Huber concerning the convergence of projection pursuit regression. Ann. Statist., 15:880-882.
3. S. V. KONYAGIN, V. N. TEMLYAKOV (1999): Rate of convergence of pure greedy algorithms. East J. Approx., 5:493-499.
4. E. D. LIVSHITZ (2000): On the rate of convergence of greedy algorithms. Manuscript.
5. E. D. LIVSHITZ, V. N. TEMLYAKOV (2000): On convergence of weak greedy algorithms. IMI-Preprint, 13:1-9.
6. V. N. TEMLYAKOV (2000): Weak greedy algorithms. Adv. in Comput. Math., 12:213-227.
7. V. N. TEMLYAKOV (2001): Two lower estimates in greedy approximation. IMI-Preprint, 7:1-12.