Bernhard G. Bodmann, “A Matching Pursuit for the Sphere Based on the Poisson Semigroup”, STSIP, 2, no. 2, 2003, 191
V N Temlyakov, “Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness”, Sb. Math., 206, no. 11, 2015, 1628
Vladimir Temlyakov, 163, Monte Carlo and Quasi-Monte Carlo Methods, 2016, 557
S.J. Dilworth, Denka Kutzarova, Karen L. Shuman, “The Weak Chebyshev X-Greedy Algorithm in the unweighted Bergman space”, Journal of Mathematical Analysis and Applications, 318, no. 2, 2006, 692
S. J. Dilworth, Denka Kutzarova, Karen L. Shuman, V. N. Temlyakov, P. Wojtaszczyk, “Weak Convergence of Greedy Algorithms in Banach Spaces”, J Fourier Anal Appl, 14, no. 5-6, 2008, 609
Chunfang Shao, Peixin Ye, “Lebesgue constants for Chebyshev thresholding greedy algorithms”, J Inequal Appl, 2018, no. 1, 2018, 102
P.M. Berná, S.J. Dilworth, D. Kutzarova, T. Oikhberg, B. Wallis, “The weighted property (A) and the greedy algorithm”, Journal of Approximation Theory, 248, 2019, 105300
Evgenii D Livshits, “The convergence of the greedy algorithm with respect to the Haar system in the spaceLp(0,1)”, Sb. Math., 201, no. 2, 2010, 253
PeiXin Ye, XiuJie Wei, “Efficiency of weak greedy algorithms for m-term approximations”, Sci. China Math., 59, no. 4, 2016, 697
M. Ganichev, N.J. Kalton, “Convergence of the weak dual greedy algorithm in Lp-spaces”, Journal of Approximation Theory, 124, no. 1, 2003, 89