V. N. TEMLYAKOV, “SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES”, Forum math. Sigma, 2, 2014, e12
Qin Guo, Xianghua Liu, Peixin Ye, “The learning performance of the weak rescaled pure greedy algorithms”, J Inequal Appl, 2024, № 1, 2024, 30
Evgenii D Livshits, “On the efficiency of the Orthogonal Matching Pursuit in compressed sensing”, Sb. Math., 203, № 2, 2012, 183
Magali Champion, Christine Cierco-Ayrolles, Sébastien Gadat, Matthieu Vignes, “Sparse regression and support recovery with L2-Boosting algorithms”, Journal of Statistical Planning and Inference, 155, 2014, 19
Xunzhi Zhu, “Approximately Normalized Iterative Hard Thresholding for Nonlinear Compressive Sensing”, Mathematical Problems in Engineering, 2016, 2016, 1
Evangelos Vlachos, Aris S. Lalos, Giannis Lionas, Kostas Berberidis, 2012 IEEE 75th Vehicular Technology Conference (VTC Spring), 2012, 1
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
Athmane Bakhta, Eric Cancès, Paul Cazeaux, Shiang Fang, Efthimios Kaxiras, “Compression of Wannier functions into Gaussian-type orbitals”, Computer Physics Communications, 230, 2018, 27
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, № 12, 2021, 1393
Vladimir Temlyakov, New Trends in Applied Harmonic Analysis, 2016, 107