61 citations to https://www.mathnet.ru/rus/mzm2288
-
Lutoborski A., Temlyakov V., “Vector Greedy Algorithms”, J. Complex., 19:4 (2003), 458–473
-
А. С. Романюк, “Приближение классов периодических функций многих переменных”, Матем. заметки, 71:1 (2002), 109–121
; A. S. Romanyuk, “Approximation of Classes of Periodic Functions in Several Variables”, Math. Notes, 71:1 (2002), 98–109
-
Temlyakov V.N., “Universal bases and greedy algorithms for anisotropic function classes”, Constr. Approx., 18:4 (2002), 529–550
-
Б. С. Кашин, “О нижних оценках для $n$-членных приближений”, Матем. заметки, 70:4 (2001), 636–638
; B. S. Kashin, “Lower Bounds for $n$-Term Approximations”, Math. Notes, 70:4 (2001), 574–576
-
Maiorov V., Meir R., “Lower Bounds For Multivariate Approximation By Affine-Invariant Dictionaries”, IEEE Trans. Inf. Theory, 47:4 (2001), 1569–1575
-
Donoho D., “Sparse Components of Images and Optimal Atomic Decompositions”, Constr. Approx., 17:3 (2001), 353–382
-
Temlyakov V.N., “Greedy algorithms with regard to multivariate systems with special structure”, Constr. Approx., 16:3 (2000), 399–425
-
Dinh Dung, “Continuous algorithms in $n$-term approximation and non-linear widths”, J. Approx. Theory, 102:2 (2000), 217–242
-
Andrianov A., “Nonlinear Haar Approximation of Functions with Bounded Mixed Derivative”, Wavelet Analysis and Multiresolution Methods, Proceedings, Lecture Notes in Pure and Applied Mathematics, 212, ed. He T., Marcel Dekker, 2000, 27–47
-
Temlyakov V., “Weak Greedy Algorithms”, Adv. Comput. Math., 12:2-3 (2000), 213–227