Wan Li, Man Lu, Peixin Ye, Wenhui Zhang, “Stability of Weak Rescaled Pure Greedy Algorithms”, Axioms, 14:6 (2025), 446
Erwan Fouillen, Claire Boyer, Maxime Sangnier, “Proximal boosting: Aggregating weak learners to minimize non-differentiable losses”, Neurocomputing, 520 (2023), 301
A. V. Dereventsov, V. N. Temlyakov, “Biorthogonal Greedy Algorithms in convex optimization”, Appl. Comput. Harmon. Anal., 60 (2022), 489–511
Wenhui Zhang, Peixin Ye, Shuo Xing, Xu Xu, “Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy Algorithms”, Axioms, 11:9 (2022), 437
Zh. Gao, G. Petrova, “Rescaled pure greedy algorithm for convex optimization”, Calcolo, 56:2 (2019), UNSP 15
H. Nguyen, G. Petrova, “Greedy strategies for convex optimization”, Calcolo, 54:1 (2017), 207–224
R. A. DeVore, V. N. Temlyakov, “Convex optimization on Banach spaces”, Found. Comput. Math., 16:2 (2016), 369–394
В. Н. Темляков, “Сходимость и скорость сходимости некоторых гриди-алгоритмов в выпуклой оптимизации”, Функциональные пространства, теория приближений, смежные разделы математического анализа, Сборник статей. К 110-летию со дня рождения академика Сергея Михайловича Никольского, Труды МИАН, 293, МАИК «Наука/Интерпериодика», М., 2016, 333–345 ; V. N. Temlyakov, “Convergence and rate of convergence of some greedy algorithms in convex optimization”, Proc. Steklov Inst. Math., 293 (2016), 325–337
V. N. Temlyakov, “Dictionary descent in optimization”, Anal. Math., 42:1 (2016), 69–89
V. N. Temlyakov, “Greedy approximation in convex optimization”, Constr. Approx., 41:2 (2015), 269–296