V. Temlyakov, 177, Mathematical Analysis, Probability and Applications – Plenary Lectures, 2016, 183
Vladimir Nikolaevich Temlyakov, “Конструктивные разреженные тригонометрические приближения и другие задачи для функций смешанной гладкости”, Математический сборник, 206, no. 11, 2015, 131
A.V. Dereventsov, V.N. Temlyakov, “A unified way of analyzing some greedy algorithms”, Journal of Functional Analysis, 277, no. 12, 2019, 108286
Vladimir N. Temlyakov, “Greedy approximation of characteristic functions”, Proc. Steklov Inst. Math., 269, no. 1, 2010, 247
A.V. Dereventsov, “On the Approximate Weak Chebyshev Greedy Algorithm in uniformly smooth Banach spaces”, Journal of Mathematical Analysis and Applications, 436, no. 1, 2016, 288
V. N. TEMLYAKOV, “SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES”, Forum math. Sigma, 2, 2014, e12
Yao Wang, Xu Liao, Shaobo Lin, “Rescaled Boosting in Classification”, IEEE Trans. Neural Netw. Learning Syst., 30, no. 9, 2019, 2598
Vladimir Temlyakov, New Trends in Applied Harmonic Analysis, 2016, 107
A. V. Dereventsov, “Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms”, Math Notes, 92, no. 3-4, 2012, 485
V. N. Temlyakov, “Greedy expansions in Banach spaces”, Adv Comput Math, 26, no. 4, 2007, 431