43 citations to 10.1023/A:1016657209416 (Crossref Cited-By Service)
  1. S.J. Dilworth, Denka Kutzarova, Karen L. Shuman, “The Weak Chebyshev X-Greedy Algorithm in the unweighted Bergman space”, Journal of Mathematical Analysis and Applications, 318, no. 2, 2006, 692  crossref
  2. Eugene D. Livshitz, Vladimir N. Temlyakov, “Sparse Approximation and Recovery by Greedy Algorithms”, IEEE Trans. Inform. Theory, 60, no. 7, 2014, 3989  crossref
  3. V. N. Temlyakov, “Dictionary descent in optimization”, Anal Math, 42, no. 1, 2016, 69  crossref
  4. Антон Вадимович Деревенцов, Anton Vadimovich Dereventsov, “Сравнение скорости сходимости чисто жадного и ортогонального жадного алгоритмов”, Матем. заметки, 92, no. 4, 2012, 528  crossref
  5. Yuwen Li, Jonathan W. Siegel, “Entropy-based convergence rates of greedy algorithms”, Math. Models Methods Appl. Sci., 34, no. 05, 2024, 779  crossref
  6. Bing Jiang, Peixin Ye, Wenhui Zhang, “Unified error estimate for weak biorthogonal Greedy algorithms”, Int. J. Wavelets Multiresolut Inf. Process., 20, no. 05, 2022, 2250010  crossref
  7. V.N. Temlyakov, “Cubature formulas, discrepancy, and nonlinear approximation”, Journal of Complexity, 19, no. 3, 2003, 352  crossref
  8. V. N. Temlyakov, “Greedy Approximation in Convex Optimization”, Constr Approx, 41, no. 2, 2015, 269  crossref
  9. Bing Jiang, Peixin Ye, “Efficiency of the weak Rescaled Pure Greedy Algorithm”, Int. J. Wavelets Multiresolut Inf. Process., 19, no. 04, 2021, 2150001  crossref
  10. D. Leviatan, V.N. Temlyakov, “Simultaneous greedy approximation in Banach spaces”, Journal of Complexity, 21, no. 3, 2005, 275  crossref
1
2
3
4
5
Next