20 citations to 10.1007/s00365-006-0652-5 (Crossref Cited-By Service)
  1. K. S. Vishnevetskiy, “Comparison of Purely Greedy and Orthogonal Greedy Algorithm”, Math Notes, 115, no. 1-2, 2024, 37  crossref
  2. Jian Fang, Shaobo Lin, Zongben Xu, “Learning and approximation capabilities of orthogonal super greedy algorithm”, Knowledge-Based Systems, 95, 2016, 86  crossref
  3. R. A. DeVore, V. N. Temlyakov, “Convex Optimization on Banach Spaces”, Found Comput Math, 16, no. 2, 2016, 369  crossref
  4. L. Burusheva, V. Temlyakov, “Sparse approximation of individual functions”, Journal of Approximation Theory, 259, 2020, 105471  crossref
  5. Lin Xu, Shaobo Lin, Zongben Xu, “Learning capability of the truncated greedy algorithm”, Sci. China Inf. Sci., 59, no. 5, 2016, 052103  crossref
  6. Yao Wang, Xu Liao, Shaobo Lin, “Rescaled Boosting in Classification”, IEEE Trans. Neural Netw. Learning Syst., 30, no. 9, 2019, 2598  crossref
  7. Michael Griebel, Peter Oswald, “Schwarz Iterative Methods: Infinite Space Splittings”, Constr Approx, 44, no. 1, 2016, 121  crossref
  8. A.V. Dereventsov, V.N. Temlyakov, “A unified way of analyzing some greedy algorithms”, Journal of Functional Analysis, 277, no. 12, 2019, 108286  crossref
  9. Lin Xu, Shaobo Lin, Yao Wang, Zongben Xu, “Shrinkage Degree in L₂-Rescale Boosting for Regression”, IEEE Trans. Neural Netw. Learning Syst., 2016, 1  crossref
  10. 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  crossref
Previous
1
2