- Qinli An, Youqian Feng, Dahua Gao, Fuping Yu, 93, Advanced Intelligent Computing Theories and Applications, 2010, 246
- Andreas Hofinger, “Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm”, Journal of Approximation Theory, 143, no. 2, 2006, 159
- V. N. Temlyakov, “Greedy expansions in convex optimization”, Proc. Steklov Inst. Math., 284, no. 1, 2014, 244
- Aleksandr Y. Aravkin, Giulio Bottegal, Gianluigi Pillonetto, “Boosting as a kernel-based method”, Mach Learn, 108, no. 11, 2019, 1951
- Weixiong Mai, Tao Qian, “Aveiro method in reproducing kernel Hilbert spaces under complete dictionary”, Math Methods in App Sciences, 40, no. 18, 2017, 7240
- Hai-Tang Chiou, Meihui Guo, Ching-Kang Ing, “Variable selection for high-dimensional regression models with time series and heteroscedastic errors”, Journal of Econometrics, 216, no. 1, 2020, 118
- Yun-Bin Zhao, Zhi-Quan Luo, “Dynamic Orthogonal Matching Pursuit for Sparse Data Reconstruction”, IEEE Open J. Signal Process., 4, 2023, 242
- E. D. Livshits, “On n-term approximation with positive coefficients”, Math Notes, 82, no. 3-4, 2007, 332
- Bernhard G. Bodmann, “A Matching Pursuit for the Sphere Based on the Poisson Semigroup”, STSIP, 2, no. 2, 2003, 191
- V. V. Galatenko, T. P. Lukashenko, V. A. Sadovnichiy, 30, Continuous and Distributed Systems II, 2015, 3