V. N. Temlyakov, “Greedy approximation”, Acta Numerica, 17, 2008, 235
A. V. Dereventsov, “Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms”, Math Notes, 92, № 3-4, 2012, 485
Andrew R. Barron, Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore, “Approximation and learning by greedy algorithms”, Ann. Statist., 36, № 1, 2008
Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “О скорости сходимости чисто жадного алгоритма”, Матем. заметки, 76, № 4, 2004, 539
Guergana Petrova, “Rescaled pure greedy algorithm for Hilbert and Banach spaces”, Applied and Computational Harmonic Analysis, 41, № 3, 2016, 852
C. Le Bris, T. Lelièvre, Y. Maday, “Results and Questions on a Nonlinear Approximation Approach for Solving High-dimensional Partial Differential Equations”, Constr Approx, 30, № 3, 2009, 621
Антон Вадимович Деревенцов, Anton Vadimovich Dereventsov, “Сравнение скорости сходимости чисто жадного и ортогонального жадного алгоритмов”, Матем. заметки, 92, № 4, 2012, 528
Vladimir N. Temlyakov, Pavel Zheltov, “On performance of greedy algorithms”, Journal of Approximation Theory, 163, № 9, 2011, 1134
V. N. Temlyakov, “Greedy expansions in Banach spaces”, Adv Comput Math, 26, № 4, 2007, 431
Xu Xu, Jinyu Guo, Peixin Ye, Wenhui Zhang, “Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm”, Mathematics, 11, № 9, 2023, 2020