Vladimir Nikolaevich Temlyakov, “Конструктивные разреженные тригонометрические приближения и другие задачи для функций смешанной гладкости”, Математический сборник, 206, № 11, 2015, 131
Pablo Manuel Berná, “Characterization of Weight-Semi-greedy Bases”, J Fourier Anal Appl, 26, № 1, 2020, 21
V. N. Temlyakov, “Greedy approximation”, Acta Numerica, 17, 2008, 235
A.V. Dereventsov, “On the Approximate Weak Chebyshev Greedy Algorithm in uniformly smooth Banach spaces”, Journal of Mathematical Analysis and Applications, 436, № 1, 2016, 288
Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “О сходимости жадного алгоритма по системе Хаара в пространствах $L_p(0,1)$”, Матем. сб., 201, № 2, 2010, 95
S. J. DILWORTH, E. ODELL, TH. SCHLUMPRECHT, ANDRÁS ZSÁK, “On the convergence of greedy algorithms for initial segments of the Haar basis”, Math. Proc. Camb. Phil. Soc., 148, № 3, 2010, 519
V. Temlyakov, “Constructive Sparse Trigonometric Approximation for Functions with Small Mixed Smoothness”, Constr Approx, 45, № 3, 2017, 467
A.V. Dereventsov, V.N. Temlyakov, “A unified way of analyzing some greedy algorithms”, Journal of Functional Analysis, 277, № 12, 2019, 108286
V. Temlyakov, 177, Mathematical Analysis, Probability and Applications – Plenary Lectures, 2016, 183
D. B. Bazarkhanov, “Nonlinear trigonometric approximations of multivariate function classes”, Proc. Steklov Inst. Math., 293, № 1, 2016, 2