Entao Liu, Vladimir N. Temlyakov, “Super greedy type algorithms”, Adv Comput Math, 37, № 4, 2012, 493
Jian Fang, Shaobo Lin, Zongben Xu, “Learning and approximation capabilities of orthogonal super greedy algorithm”, Knowledge-Based Systems, 95, 2016, 86
K. T. Poumai, S. K. Kaushik, 2017 International Conference on Sampling Theory and Applications (SampTA), 2017, 212
Paweł Bechler, Przemysław Wojtaszczyk, “Error Estimates for Orthogonal Matching Pursuit and Random Dictionaries”, Constr Approx, 33, № 2, 2011, 273
Eugene D. Livshitz, Vladimir N. Temlyakov, “Sparse Approximation and Recovery by Greedy Algorithms”, IEEE Trans. Inform. Theory, 60, № 7, 2014, 3989
Jingfan Long, Xiujie Wei, Peixin Ye, 2013 Ninth International Conference on Natural Computation (ICNC), 2013, 1408
Paweł Bechler, “Existence of the best n-term approximants for structured dictionaries”, Arch. Math., 99, № 1, 2012, 61
Wei Ma, Zhihui Xin, Guisheng Liao, Yu Sun, Zhixu Wang, Jiayu Xuan, “Sub‐region non‐local mean denoising algorithm of synthetic aperture radar images based on statistical characteristics”, IET Image Processing, 16, № 10, 2022, 2665
Jean Bourgain, Stephen J. Dilworth, Kevin Ford, Sergei V. Konyagin, Denka Kutzarova, Proceedings of the forty-third annual ACM symposium on Theory of computing, 2011, 637
Evgenii D Livshits, “On the efficiency of the Orthogonal Matching Pursuit in compressed sensing”, Sb. Math., 203, № 2, 2012, 183