Daniel Savu, Vladimir N. Temlyakov, “Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces”, IEEE Trans. Inform. Theory, 59, no. 2, 2013, 1098
Qin Guo, Xianghua Liu, Peixin Ye, “The learning performance of the weak rescaled pure greedy algorithms”, J Inequal Appl, 2024, no. 1, 2024, 30
Anatoli Juditsky, Fatma Kılınç Karzan, Arkadi Nemirovski, “Verifiable conditions of ℓ 1-recovery for sparse signals with sign restrictions”, Math. Program., 127, no. 1, 2011, 89
Khole Timothy Poumai, Sunder Deep, S. K. Kaushik, “On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames”, Numerical Functional Analysis and Optimization, 42, no. 12, 2021, 1393
Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “Об эффективности ортогонального жадного алгоритма в задаче о сжатых измерениях”, Матем. сб., 203, no. 2, 2012, 33
V. N. TEMLYAKOV, “SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES”, Forum math. Sigma, 2, 2014, e12
Vladimir Temlyakov, New Trends in Applied Harmonic Analysis, 2016, 107
Lin Xu, Shaobo Lin, Jinshan Zeng, Xia Liu, Yi Fang, Zongben Xu, “Greedy Criterion in Orthogonal Greedy Learning”, IEEE Trans. Cybern., 48, no. 3, 2018, 955
Deanna Needell, Roman Vershynin, “Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit”, Found Comput Math, 9, no. 3, 2009, 317
Vladimir N. Temlyakov, Pavel Zheltov, “On performance of greedy algorithms”, Journal of Approximation Theory, 163, no. 9, 2011, 1134