- K. S. Vishnevetskiy, “Comparison of Purely Greedy and Orthogonal Greedy Algorithm”, Math Notes, 115, no. 1-2, 2024, 37
- Jian Fang, Shaobo Lin, Zongben Xu, “Learning and approximation capabilities of orthogonal super greedy algorithm”, Knowledge-Based Systems, 95, 2016, 86
- R. A. DeVore, V. N. Temlyakov, “Convex Optimization on Banach Spaces”, Found Comput Math, 16, no. 2, 2016, 369
- L. Burusheva, V. Temlyakov, “Sparse approximation of individual functions”, Journal of Approximation Theory, 259, 2020, 105471
- Lin Xu, Shaobo Lin, Zongben Xu, “Learning capability of the truncated greedy algorithm”, Sci. China Inf. Sci., 59, no. 5, 2016, 052103
- Yao Wang, Xu Liao, Shaobo Lin, “Rescaled Boosting in Classification”, IEEE Trans. Neural Netw. Learning Syst., 30, no. 9, 2019, 2598
- Michael Griebel, Peter Oswald, “Schwarz Iterative Methods: Infinite Space Splittings”, Constr Approx, 44, no. 1, 2016, 121
- A.V. Dereventsov, V.N. Temlyakov, “A unified way of analyzing some greedy algorithms”, Journal of Functional Analysis, 277, no. 12, 2019, 108286
- Lin Xu, Shaobo Lin, Yao Wang, Zongben Xu, “Shrinkage Degree in L₂-Rescale Boosting for Regression”, IEEE Trans. Neural Netw. Learning Syst., 2016, 1
- Xianhe Wang, Xu Xu, Peixin Ye, Wenhui Zhang, “Approximation properties of some vector weak biorthogonal greedy algorithms”, Int. J. Wavelets Multiresolut Inf. Process., 22, no. 06, 2024, 2450033