V. N. Temlyakov, “Greedy approximation”, Acta Numerica, 17, 2008, 235
Jean Bourgain, Stephen Dilworth, Kevin Ford, Sergei Konyagin, Denka Kutzarova, “Explicit constructions of RIP matrices and related problems”, Duke Math. J., 159, № 1, 2011
Shihong Yao, Tao Wang, Yanwen Chong, Shaoming Pan, “Sparsity estimation based adaptive matching pursuit algorithm”, Multimed Tools Appl, 77, № 4, 2018, 4095
Yael Yankelevsky, Michael Elad, “Theoretical guarantees for graph sparse coding”, Applied and Computational Harmonic Analysis, 49, № 2, 2020, 698
E.D. Livshitz, “On the optimality of the Orthogonal Greedy Algorithm for μ-coherent dictionaries”, Journal of Approximation Theory, 164, № 5, 2012, 668
A. Çivril, “Sparse approximation is provably hard under coherent dictionaries”, Journal of Computer and System Sciences, 84, 2017, 32
Entao Liu, Vladimir N. Temlyakov, “The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing”, IEEE Trans. Inform. Theory, 58, № 4, 2012, 2040
Yigang Cen, Fangfei Wang, Ruizhen Zhao, Lihong Cui, Lihui Cen, Zhenjiang Miao, Yanming Cen, “Tree-Based Backtracking Orthogonal Matching Pursuit for Sparse Signal Reconstruction”, Journal of Applied Mathematics, 2013, 2013, 1
K. T. Poumai, S. K. Kaushik, “Frames and non linear approximations in Hilbert spaces”, J. Contemp. Mathemat. Anal., 51, № 1, 2016, 41
Chunfang Shao, Jincai Chang, Peixin Ye, Wenhui Zhang, Shuo Xing, “Almost Optimality of the Orthogonal Super Greedy Algorithm for μ-Coherent Dictionaries”, Axioms, 11, № 5, 2022, 186