- Chuanfu Xiao, Zeyu Li, Chao Yang, “Higher-Order Self-Consistent Field: Efficient Decoupling Algorithms for Finding the Best Rank-One Approximation of Higher-Order Tensors”, SIAM J. Matrix Anal. Appl., 46, № 2, 2025, 1518

- Wei Qu, Ying Zhang, Tao Qian, “Sparse Representation of Random Field Via Probability Chaos”, Math Methods in App Sciences, 2025, mma.11167

- Jason M. Klusowski, Jonathan W. Siegel, “Sharp Convergence Rates for Matching Pursuit”, IEEE Trans. Inform. Theory, 71, № 7, 2025, 5556

- Robert Schaback, Holger Wendland, “Adaptive greedy techniques for approximate solution of large RBF systems”, Numerical Algorithms, 24, № 3, 2000, 239

- E. D. Livshits, “Rate of Convergence of Pure Greedy Algorithms”, Mathematical Notes, 76, № 3-4, 2004, 497

- A. V. Sil'nichenko, “Rate of Convergence of Greedy Algorithms”, Mathematical Notes, 76, № 3-4, 2004, 582

- Y.C. Hon, R. Schaback, X. Zhou, “An Adaptive Greedy Algorithm for Solving Large RBF Collocation Problems”, Numerical Algorithms, 32, № 1, 2003, 13

- E. D. Livshits, “Convergence of Greedy Algorithms in Banach Spaces”, Mathematical Notes, 73, № 3-4, 2003, 342

- V Temlyakov, “Sparse sampling recovery by greedy algorithms”, IMA Journal of Numerical Analysis, 2025, draf054

- Binh Thanh Dang, 2586, Computational Intelligence in Engineering Science, 2026, 44
