Voir la notice de l'article provenant de la source Math-Net.Ru
[1] DeVore R. A., Temlyakov V. N., “Some remarks on Greedy algorithms”, Adv. Comput. Math., 5 (1996), 173–187 | DOI | MR | Zbl
[2] Temlyakov V. N., Nonlinear Methods of Approximation, IMI Preprint Series. No 9, 2001, p. 1–57; http://www.math.sc.edu/ĩmip
[3] Jones L. K., “On a conjecture of Huber concerning the projection persuit regression”, Ann. Statist., 15 (1987), 880–882 | DOI | MR | Zbl
[4] Donahue M., Gurvits L., Darken C., Sontaq E., “Rate of convex approximation in non-Hilbert spaces”, Constr. Approx., 13 (1997), 187–220 | DOI | MR | Zbl
[5] Dubinin V. V., Greedy Algorithms and Applications, Ph. D. Thesis, Univ. South Carolina, 1997
[6] Temlyakov V. N., “Greedy algorithms in Banach spaces”, Adv. Comput. Math., 14 (2001), 277–292 | DOI | MR | Zbl
[7] Dilworth S. J., Kutzarova D., Temlyakov V. N., Convergence of Some Greedy Algorithms in Banach Spaces, IMI Preprint Series. No 14, 2001, p. 1–21; http://www.math.sc.edu/ĩmip | MR
[8] Distel Dzh., Geometriya banakhovykh prostranstv. Izbrannye glavy, Vischa shkola, Kiev, 1980