A.V. Dereventsov, V.N. Temlyakov, “A unified way of analyzing some greedy algorithms”, Journal of Functional Analysis, 277, no. 12, 2019, 108286
H. B. Zhao, Q. Pan, Y. Liang, Y. M. Cheng, 2009 International Conference on Information and Automation, 2009, 12
Shaobo Lin, Yuanhua Rong, Xingping Sun, Zongben Xu, “Learning Capability of Relaxed Greedy Algorithms”, IEEE Trans. Neural Netw. Learning Syst., 24, no. 10, 2013, 1598
M. Ganichev, N.J. Kalton, “Convergence of the weak dual greedy algorithm in Lp-spaces”, Journal of Approximation Theory, 124, no. 1, 2003, 89
A. A. Sargsyan, “On Faber-Schauder coefficients of continuous functions and divergence of greedy algorithm”, Russ Math., 63, no. 5, 2019, 57
С Л Гогян, S L Gogyan, “Об $m$-членном приближении в $L^1(0,1)$ по системе Хаара”, Матем. заметки, 79, no. 4, 2006, 631
K.S. Kazarian, V.N. Temlyakov, “Hilbert spaces of vector-valued functions generated by quadratic forms”, Journal of Mathematical Analysis and Applications, 402, no. 1, 2013, 334
Michael Tschannen, Helmut Bolcskei, “Noisy Subspace Clustering via Matching Pursuits”, IEEE Trans. Inform. Theory, 64, no. 6, 2018, 4081
Volker Michel, Handbook of Geomathematics, 2015, 2121
Hufei Zhu, Wen Chen, Yanpeng Wu, “Efficient Implementations for Orthogonal Matching Pursuit”, Electronics, 9, no. 9, 2020, 1507