Petr Anatolevich Borodin, Sergei Vladimirovich Konyagin, “Проекционный жадный алгоритм”, Математические заметки, 110, no. 1, 2021, 17
Xu Xu, Jinyu Guo, Peixin Ye, Wenhui Zhang, “Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm”, Mathematics, 11, no. 9, 2023, 2020
R. Gribonval, P. Vandergheynst, “On the exponential convergence of matching pursuits in quasi-incoherent dictionaries”, IEEE Trans. Inform. Theory, 52, no. 1, 2006, 255
Alexei Lozinski, Robert G. Owens, Timothy N. Phillips, 16, Numerical Methods for Non-Newtonian Fluids, 2011, 211
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
A. Çivril, “A note on the hardness of sparse approximation”, Information Processing Letters, 113, no. 14-16, 2013, 543
M. Ganichev, N.J. Kalton, “Convergence of the weak dual greedy algorithm in Lp-spaces”, Journal of Approximation Theory, 124, no. 1, 2003, 89
Entao Liu, Vladimir N. Temlyakov, “Super greedy type algorithms”, Adv Comput Math, 37, no. 4, 2012, 493
Владимир Владимирович Галатенко, Vladimir Vladimirovich Galatenko, Евгений Давидович Лившиц, Evgenii Davidovich Livshits, “Обобщенные приближенные слабые жадные алгоритмы”, Матем. заметки, 78, no. 2, 2005, 186
O.D. Escoda, G. Monaci, R.M. Figueras i Ventura, P. Vandergheynst, M. Bierlaire, “Geometric Video Approximation Using Weighted Matching Pursuit”, IEEE Trans. on Image Process., 18, no. 8, 2009, 1703