8 citations to https://www.mathnet.ru/rus/tm216
-
V. N. Temlyakov, “Brief introduction in greedy approximation”, УМН, 80:5(485) (2025), 23–104
-
Jiang B., Ye P., “Efficiency of the Weak Rescaled Pure Greedy Algorithm”, Int. J. Wavelets Multiresolut. Inf. Process., 19:04 (2021), 2150001
-
Temlyakov V.N., “Greedy Approximation”, Acta Numerica 2008, Vol 17, Acta Numerica-Series, 17, ed. Iserles A., Cambridge Univ Press, 2008, 235–409
-
Е. Д. Лившиц, “Об $n$-членном приближении с неотрицательными коэффициентами”, Матем. заметки, 82:3 (2007), 373–382
; E. D. Livshits, “On $n$-Term Approximation with Positive Coefficients”, Math. Notes, 82:3 (2007), 332–340
-
Е. Д. Лившиц, “О возвратном жадном алгоритме”, Изв. РАН. Сер. матем., 70:1 (2006), 95–116
; E. D. Livshits, “On the recursive greedy algorithm”, Izv. Math., 70:1 (2006), 87–108
-
В. В. Галатенко, Е. Д. Лившиц, “Обобщенные приближенные слабые жадные алгоритмы”, Матем. заметки, 78:2 (2005), 186–201
; V. V. Galatenko, E. D. Livshits, “Generalized Approximate Weak Greedy Algorithms”, Math. Notes, 78:2 (2005), 170–184
-
Kamont A., Temlyakov V.N., “Greedy approximation and the multivariate Haar system”, Studia Math., 161:3 (2004), 199–223
-
Ganichev M., Kalton N.J., “Convergence of the weak dual greedy algorithm in $L_p$-spaces”, J. Approx. Theory, 124:1 (2003), 89–95