Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Temlyakov, Vladimir Nikolaevich

Total publications: 176 (173)
in MathSciNet: 173 (171)
in zbMATH: 145 (145)
in Web of Science: 94 (91)
in Scopus: 108 (107)
Cited articles: 151
Citations in Math-Net.Ru: 495
Citations in Web of Science: 3602
Citations in Scopus: 3407
Presentations: 5

Number of views:
This page:7672
Abstract pages:20943
Full texts:7312
References:1369
Professor
Doctor of physico-mathematical sciences (1981)
Speciality: 01.01.01 (Real analysis, complex analysis, and functional analysis)
E-mail: ,
Website: http://www.math.sc.edu/people/temlyakov.html

Subject:

Approximations of functions in one variable and multivariable cases (approximations by polynomials, n-widths, optimal cubature formulas). Integral operators (estimates of singular numbers, approximation numbers, bilinear approximation of kernels of these operators).


http://www.mathnet.ru/eng/person18590
https://scholar.google.com/citations?user=4q491GsAAAAJ&hl=en
https://zbmath.org/authors/?q=ai:temlyakov.vladimir-n|temljakov.v-n
https://mathscinet.ams.org/mathscinet/MRAuthorID/206797
https://www.researchgate.net/profile/V_Temlyakov

Full list of publications:
| scientific publications | by years | by types | by times cited in WoS | by times cited in Scopus | common list |



   2021
1. V. N. Temlyakov, “Sampling Discretization of Integral Norms of the Hyperbolic Cross Polynomials”, Proc. Steklov Inst. Math., 312 (2021), 270–281  mathnet  crossref  crossref  isi  elib  scopus (cited: 2)
2. S. Dilworth, G. Garrigós, E. Hernández, D. Kutzarova, V. Temlyakov, “Lebesgue-type inequalities in greedy approximation”, J. Funct. Anal., 280 (2021), 108885 , 37 pp.  mathnet  crossref  isi  scopus;
3. A. S. Rubtsova, K. S. Ryutin, V. N. Temlyakov, “On the fixed volume discrepancy of the Korobov point sets”, Sb. Math., 212:8 (2021), 1180–1192  mathnet  crossref  crossref
4. P. A. Borodin, M. I. Dyachenko, B. S. Kashin, T. P. Lukashenko, I. I. Mel'nikov, V. A. Sadovnichii, B. V. Simonov, V. A. Skvortsov, A. P. Solodov, V. N. Temlyakov, S. Yu. Tikhonov, V. M. Fedorov, “Mikhail Konstantinovich Potapov (on his 90th birthday)”, Russian Math. Surveys, 76:2 (2021), 369–371  mathnet  crossref  crossref  isi

   2020
5. V. N. Temlyakov, M. Ullrich, “On the fixed volume discrepancy of the Fibonacci sets in the integral norms”, J. Complexity, 61 (2020), 101472 , 8 pp.  mathnet  crossref  mathscinet  isi  scopus (cited: 1);
6. L. Burusheva, V. Temlyakov, “Sparse approximation of individual functions”, J. Approx. Theory, 259 (2020), 105471 , 12 pp.  mathnet  crossref  mathscinet  isi  scopus;

   2019
7. V. N. Temlyakov, “Smooth fixed volume discrepancy, dispersion, and related problems”, J. Approx. Theory, 237 (2019), 113–134  mathnet  crossref  mathscinet  zmath  isi (cited: 2)  scopus (cited: 1)
8. F. Dai, A. Prymak, V. N. Temlyakov, S. Yu. Tikhonov, “Integral norm discretization and related problems”, Russian Math. Surveys, 74:4 (2019), 579–630  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 9)  elib  scopus (cited: 8)
9. A. V. Dereventsov, V. N. Temlyakov, “A unified way of analyzing some greedy algorithms”, J. Funct. Anal., 277:12 (2019), 108286–30 , arXiv: 1801.06198  mathnet  crossref  mathscinet  zmath  isi (cited: 2)  scopus (cited: 2)

   2018
10. V.N. Temlyakov, “Universal discretization”, J. Complexity, 47 (2018), 97–109  mathnet  crossref  mathscinet  isi (cited: 6)  scopus (cited: 8)
11. V. N. Temlyakov, “The Marcinkiewicz–type discretization theorems”, Constr. Approx., 48:2 (2018), 337–369  mathnet (cited: 2)  crossref  mathscinet  isi (cited: 13)  scopus (cited: 14)
12. B. S. Kashin, V. N. Temlyakov, “Observations on discretization of trigonometric polynomials with given spectrum”, Russian Math. Surveys, 73:6 (2018), 1128–1130  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 5)  elib  scopus (cited: 5)
13. S. J. Dilworth, D. Kutzarova, V. N. Temlyakov, B. Wallis, “Weight-almost greedy bases”, Proc. Steklov Inst. Math., 303 (2018), 109–128  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 2)  elib  scopus (cited: 1)
14. V. Temlyakov, Multivariate approximation, Cambridge Monogr. Appl. Comput. Math., 32, Cambridge University Press, Cambridge, 2018 , 550 pp.  mathscinet  zmath
15. Dinh Dũng, Vladimir Temlyakov, Tino Ullrich, Hyperbolic cross approximation, Advanced Courses in Mathematics - CRM Barcelona, Birkhäuser Basel, Basel, 2018 , xi+218 pp.  crossref  mathscinet  zmath

   2017
16. V. Temlyakov, “On the entropy numbers of the mixed smoothness function classes”, J. Approx. Theory, 217 (2017), 26–56  mathnet  crossref  mathscinet  isi (cited: 11)  elib  scopus (cited: 12)
17. V. Temlyakov, “Constructive Sparse Trigonometric Approximation for Functions with Small Mixed Smoothness”, Constr. Approx., 45 (2017), 467–495  mathnet  crossref  mathscinet  isi (cited: 6)  elib  scopus (cited: 5)
18. V. Temlyakov, S. Tikhonov, “Remez-Type and Nikol’skii-Type Inequalities: General Relations and the Hyperbolic Cross Polynomials”, Constr. Approx., 46:3 (2017), 593–615  mathnet  crossref  mathscinet  isi (cited: 5)  elib  scopus (cited: 5)

   2016
19. V. N. Temlyakov, “Dictionary descent in optimization”, Anal. Math., 42:1 (2016), 69–89  mathnet  crossref  mathscinet  isi (cited: 5)  elib  scopus (cited: 6)
20. V. N. Temlyakov, “Convergence and rate of convergence of some greedy algorithms in convex optimization”, Proc. Steklov Inst. Math., 293 (2016), 325–337  mathnet  crossref  crossref  mathscinet  isi (cited: 2)  elib  elib  scopus (cited: 2)
21. Vladimir Temlyakov, “Incremental greedy algorithm and its applications in numerical integration” (MCQMC, Leuven, Belgium, April 2014), Springer Proc. Math. Statist., 163, 2016, 557–570  mathnet  crossref  mathscinet  isi (cited: 2)  elib  scopus (cited: 1)
22. V. N. Temlyakov, “Sparse approximation by greedy algorithm”, Springer Proc. Math. Statist., 177, 2016, 183–215  mathnet  crossref  mathscinet  isi  elib  scopus

   2015
23. V. N. Temlyakov, “Greedy approximation in convex optimization”, Constr. Approx., 41:2 (2015), 269–296  mathnet  crossref  mathscinet  isi (cited: 16)  elib (cited: 5)  scopus
24. D. Bazarkhanov, V. Temlyakov, “Nonlinear tensor product approximation of functions”, J. Complexity, 31:6 (2015), 867–884  mathnet  crossref  mathscinet  isi (cited: 3)  elib  scopus (cited: 3)
25. V. N. Temlyakov, “Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness”, Sb. Math., 206:11 (2015), 1628–1656  mathnet  crossref  crossref  mathscinet  adsnasa  isi (cited: 15)  elib  elib  scopus (cited: 2)

   2014
26. V. N. Temlyakov, “Greedy Expansions in Convex Optimization”, Proc. Steklov Inst. Math., 284 (2014), 244–262  mathnet  crossref  crossref  isi (cited: 7)  elib (cited: 2)  elib (cited: 2)  scopus (cited: 5)
27. V. N. Temlyakov, “Incoherent systems and coverings in finite dimensional Banach spaces”, Sb. Math., 205:5 (2014), 703–721  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi (cited: 1)  elib  elib  scopus
28. E. D. Livshitz, V. N. Temlyakov, “Sparse approximation and recovery by greedy algorithms”, IEEE Trans. Inform. Theory, 60:7 (2014), 3989–4000  mathnet  crossref  mathscinet  zmath  isi (cited: 14)  elib (cited: 5)  scopus (cited: 15)
29. V. N. Temlyakov, “Sparse approximation and recovery by greedy algorithms in Banach spaces”, Forum Math. Sigma, 2 (2014), e12 , 26 pp.  mathnet  crossref  mathscinet  zmath  scopus (cited: 10)
30. G. Kerkyacharian, A. B. Tsybakov, V. N. Temlyakov, D. Picard, V. Koltchinskii, “Optimal exponential bounds on the accuracy of classification”, Constr. Approx., 39:3 (2014), 421–444  mathnet  crossref  mathscinet  zmath  isi (cited: 2)  scopus (cited: 2)

   2013
31. Proc. Steklov Inst. Math., 280 (2013), 227–239  mathnet  crossref  crossref  mathscinet  isi  elib  elib  scopus
32. K. Kazarian, V. N. Temlyakov, “Greedy bases in $L^p$ spaces”, Proc. Steklov Inst. Math., 280 (2013), 181–190  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 3)  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
33. V. N. Temlyakov, “An inequality for the entropy numbers and its application”, J. Approx. Theory, 173 (2013), 110–121  mathnet  crossref  mathscinet  zmath  isi (cited: 9)  elib (cited: 1)  scopus (cited: 10)
34. D. Bilyk, V. N. Temlyakov, R. Yu, “The $L_2$ discrepancy of two-dimensional lattices”, Recent advances in harmonic analysis and applications, Springer Proc. Math. Stat., 25, Springer, New York, 2013, 63–77  mathnet  crossref  mathscinet  zmath  scopus (cited: 6)
35. V. Temlyakov, “How young we were”, Recent advances in harmonic analysis and applications, Springer Proc. Math. Stat., 25, Springer, New York, 2013, 43–46  mathnet  crossref  mathscinet  zmath  scopus  scopus
36. K. S. Kazarian, V. N. Temlyakov, “Hilbert spaces of vector-valued functions generated by quadratic forms”, J. Math. Anal. Appl., 402:1 (2013), 334–347  mathnet  crossref  mathscinet  zmath  isi  elib  scopus
37. D. Savu, V. N. Temlyakov, “Lebesgue-type inequalities for greedy approximation in Banach spaces”, IEEE Trans. Inform. Theory, 59:2 (2013), 1098–1106  mathnet  crossref  mathscinet  zmath  isi (cited: 4)  scopus (cited: 4)

   2012
38. D. Bilyk, V. N. Temlyakov and Rui Yu, “Fibonacci sets are good for discrepancy and numerical integration”, J. Complexity, 28:1 (2012), 18–36  mathnet  crossref  mathscinet  zmath  isi (cited: 11)  elib (cited: 2)  scopus (cited: 14)
39. S. Dilworth, M. Soto-Bajo, and V. N. Temlyakov, Quasi-greedy bases and Lebesgue-type inequalities, IMI Preprint No 02, 2012 , 44 pp.
40. E. Liu and V. N. Temlyakov, “The orthogonal super greedy algorithm and applications in compressed sensing”, IEEE Trans. Inform. Theory, 58:4 (2012), 2040–2047  mathnet  crossref  mathscinet  zmath  isi (cited: 120)  scopus (cited: 138)
41. E. Liu and V. N. Temlyakov, “Super greedy type algorithms”, Adv. Comput. Math., 37:4 (2012), 493–504  mathnet  crossref  mathscinet  zmath  isi (cited: 8)  scopus (cited: 7)
42. S. J. Dilworth, M. Soto-Bajo, V. N. Temlyakov, “Quasi-greedy bases and Lebesgue-type inequalities”, Stud. Math., 211:1 (2012), 41–69  mathnet  crossref  mathscinet  zmath  isi (cited: 20)  scopus (cited: 20)

   2011
43. V. Temlyakov, Greedy approximation, Cambridge Monogr. Appl. Comput. Math., 20, Cambridge University Press, Cambridge, 2011 , xiv+418 pp.  mathscinet  zmath
44. V. N. Temlyakov, Mingrui Yang, Peixin Ye, “Greedy approximation with regard to non-greedy bases,”, Adv. Comput. Math., 34:3 (2011), 319–337  crossref  mathscinet  zmath  isi (cited: 9)  scopus (cited: 10)
45. V. N. Temlyakov, P. Zheltov, “On performance of greedy algorithms”, J. Approx. Theory, 163:9 (2011), 1134–1145  crossref  mathscinet  zmath  isi (cited: 24)  elib (cited: 6)  scopus (cited: 21)
46. V. N. Temlyakov, Mingrui Yang, Peixin Ye, “Lebesgue-type inequalities for greedy approximation with respect to quasi-greedy bases”, East J. Approx., 17:2 (2011), 127–138  mathscinet
47. S. V. Konyagin, Yu. V. Malykhin and V. N. Temlyakov, “On basis sets in Banach spaces”, East J. Approx., 17 (2011), 215–220  mathscinet  zmath
48. J. L. Nelson and V. N. Temlyakov, “On the size of incoherent systems”, J. Approximation Theory, 163:9 (2011), 1238–1245  crossref  mathscinet  zmath  isi (cited: 11)  scopus (cited: 13)

   2010
49. Proc. Steklov Inst. Math., 269 (2010), 247–258  mathnet  crossref  mathscinet  zmath  zmath  isi  elib  elib  scopus

   2008
50. V. N. Temlyakov, “Approximation in learning theory”, Constr. Approx., 27:1 (2008), 33–74  crossref  mathscinet  zmath  isi (cited: 15)  elib  scopus (cited: 18)
51. V. N. Temlyakov, “Relaxation in greedy approximation”, Constr. Approx., 28:1 (2008), 1–25  crossref  mathscinet  zmath  isi (cited: 14)  elib (cited: 5)  scopus (cited: 13)
52. S. J. Dilworth, D. Kutzarova, K. L. Shuman, V. N. Temlyakov, P. Wojtaszczyk, “Weak convergence of greedy algorithms in Banach spaces”, J. Fourier Anal. Appl., 14:5-6 (2008), 609–628  crossref  mathscinet  zmath  isi (cited: 5)  scopus (cited: 6)
53. V. N. Temlyakov, “Greedy approximation”, Acta Numer., 17 (2008), 235–409  crossref  mathscinet  zmath  isi (cited: 96)  elib (cited: 24)  scopus (cited: 108)
54. V. Temlyakov, “Convergence of greedy approximation with regard to the trigonometric system”, Topics in classical analysis and applications in honor of Daniel Waterman, World Sci. Publ., Hackensack, NJ, 2008, 161–172  crossref  mathscinet  zmath  scopus (cited: 3)
55. B. S. Kashin, V. N. Temlyakov, “On a Norm and Approximate Characteristics of Classes of Multivariable Functions”, Journal of Mathematical Sciences, 155:1 (2008), 57–80  mathnet  crossref  mathscinet  zmath  elib  scopus (cited: 3)

   2007
56. B. S. Kashin, V. N. Temlyakov, “A Remark on Compressed Sensing”, Math. Notes, 82:6 (2007), 748–755  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 38)  elib (cited: 28)  elib (cited: 28)  scopus (cited: 38)
57. S. V. Konyagin, V. N. Temlyakov, “The entropy in learning theory. Error estimates”, Constr. Approx., 25:1 (2007), 1–27  crossref  mathscinet  zmath  isi (cited: 13)  elib (cited: 3)  scopus (cited: 14)
58. V. N. Temlyakov, “Greedy expansions in Banach spaces”, Adv. Comput. Math., 26:4 (2007), 431–449  crossref  mathscinet  zmath  isi (cited: 6)  elib (cited: 3)  scopus (cited: 7)
59. D. Donoho, M. Elad, V. N. Temlyakov, “On the Lebesgue type inequalities for greedy approximation”, J. Approx. Theory, 147:2 (2007), 185–195  crossref  mathscinet  zmath  isi (cited: 32)  scopus (cited: 33)
60. V. N. Temlyakov, “Greedy algorithms with prescribed coefficients”, J. Fourier Anal. Appl., 13:1 (2007), 71–86  crossref  mathscinet  zmath  isi (cited: 3)  elib (cited: 2)  scopus (cited: 5)
61. V. N. Temlyakov, “Universality in approximation and estimation”, Curve and surface fitting: Avignon 2006, Mod. Methods Math., Nashboro Press, Brentwood, TN, 2007, 247–265  mathscinet
62. V. Temlyakov, “Greedy approximation in Banach spaces”, Banach spaces and their applications in analysis, Proceedings of the conference dedicated to N. Kalton, 60, Walter de Gruyter, Berlin, 2007, 193–208  mathscinet  zmath

   2006
63. V. N. Temlyakov, “On Universal Estimators in Learning Theory”, Proc. Steklov Inst. Math., 255 (2006), 244–259  mathnet  crossref  mathscinet  scopus
64. R. DeVore, G. Kerkyacharian, D. Picard, V. Temlyakov, “Approximation methods for supervised learning”, Found. Comp. Math., 6:1 (2006), 3–58  crossref  mathscinet  zmath  isi (cited: 42)  elib  scopus (cited: 53)
65. D. L. Donoho, M. Elad and V. N. Temlyakov, “Stable recovery of sparse overcomplete representations in the presence of noise”, IEEE Trans. Inform. Theory, 52:1 (2006), 6–18  crossref  mathscinet  zmath  isi (cited: 1543)  scopus (cited: 1596)
66. V. N. Temlyakov, “Optimal estimators in learning theory”, Approximation and probability, Banach Center Publ., 72, Polish Acad. Sci. Inst. Math., Warsaw, 2006, 341–366  crossref  mathscinet  zmath
67. G. Kerkyacharian, D. Picard, V. N. Temlyakov, “Some inequalities for the tensor product of greedy bases and weight-greedy bases”, East J. Approx., 12:1 (2006), 103–118  mathscinet
68. V. N. Temlyakov, “Greedy approximations”, Foundations of computational mathematics, Santander 2005, London Math. Soc. Lecture Note Ser., 331, Cambridge Univ. Press, Cambridge, 2006, 371–394  mathscinet  zmath
69. V. N. Temlyakov, “Greedy approximations with regard to bases”, International Congress of Mathematicians. Vol. II, Eur. Math. Soc., Zürich, 2006, 1479–1504  mathscinet  zmath
70. D. Leviatan and V. N. Temlyakov, “Simultaneous approximation by greedy algorithms”, Adv. Comput. Math., 25:1-3 (2006), 73–90  crossref  mathscinet  zmath  isi (cited: 26)  scopus (cited: 30)

   2005
71. V. N. Temlyakov, “Greedy Algorithms with Restricted Depth Search”, Proc. Steklov Inst. Math., 248 (2005), 255–267  mathnet  mathscinet  zmath
72. V. N. Temlyakov, “Greedy-type approximation in Banach spaces and applications”, Constr. Approx., 21:2 (2005), 257–292  crossref  mathscinet  zmath  isi (cited: 19)  elib  scopus (cited: 19)
73. D. Leviatan and V. N. Temlyakov, “Simultaneous greedy approximation in Banach spaces”, J. Complexity, 21:3 (2005), 275–293  crossref  mathscinet  zmath  isi (cited: 5)  scopus (cited: 7)
74. S. V. Konyagin, V. N. Temlyakov, “Convergence of greedy approximation for the trigonometric system”, Anal. Math., 31:2 (2005), 85–115  crossref  mathscinet  zmath  elib (cited: 4)  scopus (cited: 5)
75. P. Binev, A. Cohen, W. Dahmen, R. DeVore, V. Temlyakov, “Universal algorithms for learning theory. I. Piecewise constant functions”, J. Mach. Learn. Res., 6 (2005), 1297–1321  mathscinet  zmath  isi (cited: 41)

   2004
76. A. Kamont and V.N. Temlyakov, “Greedy approximation and the multivariate Haar system”, Studia Math., 161:3 (2004), 199–223  crossref  mathscinet  zmath  isi (cited: 11)  scopus (cited: 12)
77. V. N. Temlyakov, “A remark on simultaneous greedy approximation”, East J. Approx., 10:1-2 (2004), 17–25  mathscinet  zmath
78. S. V. Konyagin, V. N. Temlyakov, “Some error estimates in Learning Theory”, Approximation theory, A volume dedicated to Borislav Bojanov, Prof. M. Drinov Acad. Publ. House, Sofia, 2004, 126–144  mathscinet

   2003
79. V. N. Temlyakov, “Nonlinear methods of approximation”, Found. Comput. Math., 3:1 (2003), 33–107  crossref  mathscinet  zmath  isi (cited: 150)  scopus (cited: 162)
80. E. D. Livshitz and V. N. Temlyakov, “Two lower estimates in greedy approximation”, Constr. Approx., 19:4 (2003), 509–523  crossref  mathscinet  zmath  isi (cited: 20)  scopus (cited: 21)
81. S. J. Dilworth, N. J. Kalton, D. Kutzarova, V. N. Temlyakov, “The thresholding greedy algorithm, greedy bases, and duality”, Constr. Approx., 19:4 (2003), 575–597  crossref  mathscinet  zmath  isi (cited: 69)  scopus (cited: 72)
82. R. De Vore, G. Petrova, V. Temlyakov, “Best basis selection for approximation in $L_p$”, Found. Comput. Math., 3:2 (2003), 161–185  crossref  mathscinet  zmath  isi  scopus (cited: 2)
83. V. N. Temlyakov, “Cubature formulas, discrepancy, and nonlinear approximation”, Numerical integration and its complexity (Oberwolfach, 2001), J. Complexity, 19, no. 3, 2003, 352–391  crossref  mathscinet  zmath  isi (cited: 42)  scopus (cited: 41)
84. S. V. Konyagin, V. N. Temlyakov, “Convergence of Greedy Approximation I. General Systems”, Studia Math., 159:1 (2003), 143–160  crossref  mathscinet  zmath  isi (cited: 10)  scopus (cited: 9)
85. S. V. Konyagin, V. N. Temlyakov, “Convergence of greedy approximation. II. The trigonometric system”, Studia Math., 159:2 (2003), 161–184  crossref  mathscinet  zmath  isi (cited: 15)  scopus (cited: 15)
86. A. Lutoborski, V. N. Temlyakov, “Vector greedy algorithms”, J. Complexity, 19:4 (2003), 458–473  crossref  mathscinet  zmath  isi (cited: 18)  scopus (cited: 21)
87. B. S. Kashin, V. N. Temlyakov, “The volume estimates and their applications”, East J. Approx., 9:4 (2003), 469–485  mathscinet  zmath

   2002
88. V. N. Temlyakov, “Universal bases and greedy algorithms for anisotropic function classes”, Constr. Approx., 18:4 (2002), 529–550  crossref  mathscinet  zmath  isi (cited: 15)  scopus (cited: 14)
89. V. E. Maiorov, K. I. Oskolkov, V. N. Temlyakov, “Gridge approximation and Radon compass”, Approximation theory, A volume dedicated to Blagovest Sendov, DARBA, Sofia, 2002, 284–309  mathscinet  zmath
90. V. N. Temlyakov, “A criterion for convergence of Weak Greedy Algorithms”, Adv. Comput. Math., 17:3 (2002), 269–280  crossref  mathscinet  zmath  isi (cited: 10)  scopus (cited: 10)
91. S. J. Dilworth, D. Kutzarova, V. N. Temlyakov, “Convergence of some greedy algorithms in Banach spaces”, J. Fourier Anal. Appl., 8:5 (2002), 489–505  crossref  mathscinet  zmath  isi (cited: 23)  scopus (cited: 23)
92. V. N. Temlyakov, “Nonlinear approximation with regard to bases”, Approximation theory, X (St. Louis, MO, 2001), Innov. Appl. Math., Vanderbilt Univ. Press, Nashville, TN, 2002, 373–402  mathscinet  zmath
93. S. V. Konyagin and V. N. Temlyakov, “Greedy approximation with regard to bases and general minimal systems”, Serdica Math. J., 28:4 (2002), 305–328  mathscinet  zmath

   2001
94. E. D. Livshits, V. N. Temlyakov, “On Convergence of Weak Greedy Algorithms”, Proc. Steklov Inst. Math., 232 (2001), 229–239  mathnet  mathscinet  zmath
95. V. N. Temlyakov, “Greedy algorithms in Banach spaces”, Adv. Comput. Math., 14:3 (2001), 277–292  crossref  mathscinet  zmath  isi (cited: 38)  scopus (cited: 42)

   2000
96. V. N. Temlyakov, “Greedy algorithms with regard to multivariate systems with special structure”, Constr. Approx., 16:3 (2000), 399–425  crossref  mathscinet  zmath  isi (cited: 24)  scopus (cited: 32)
97. V. N. Temlyakov, “Weak greedy algorithms”, Adv. Comput. Math., 12:2-3 (2000), 213–227  crossref  mathscinet  zmath  isi (cited: 122)

   1999
98. V. N. Temlyakov, “Greedy algorithms and $m$-term approximation with regard to redundant dictionaries”, J. Approx. Theory, 98:1 (1999), 117–145  crossref  mathscinet  zmath  isi (cited: 51)  scopus (cited: 56)
99. B. S. Kashin, V. N. Temlyakov, “On a norm and approximation characteristics of classes of functions of several variables”, Metric theory of functions and related problems in analysis, eds. S. M. Nikol'skii, Izd. Nauchno-Issled. Aktuarno-Finans. Tsentra (AFTs), Moscow, 1999, 69–99  mathscinet
100. S. V. Konyagin, V. N. Temlyakov, “A remark on greedy approximation in Banach spaces”, East J. Approx., 5:3 (1999), 365–379  mathscinet  zmath
101. S. V. Konyagin, V. N. Temlyakov, “Rate of convergence of Pure Greedy Algorithm”, East J. Approx., 5:4 (1999), 493–499  mathscinet  zmath

   1998
102. B. S. Kashin, V. N. Temlyakov, “On a certain norm and related applications”, Math. Notes, 64:4 (1998), 551–554  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 14)
103. V. N. Temlyakov, “Nonlinear Kolmogorov widths”, Math. Notes, 63:6 (1998), 785–795  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 16)
104. R. A. DeVore, S. V. Konyagin, V. N. Temlyakov, “Hyperbolic wavelet approximation”, Constr. Approx., 14:1 (1998), 1–26  crossref  mathscinet  isi (cited: 88)  scopus (cited: 92)
105. V. N. Temlyakov, “The best $m$-term approximation and greedy algorithms”, Advances in Comp. Math., 8:3 (1998), 249–265  crossref  mathscinet  zmath  isi (cited: 117)  scopus (cited: 120)
106. V. N. Temlyakov, “Non-linear $m$-term approximation with regard to the multivariate Haar system”, East J. Approx., 4:1 (1998), 87–106  mathscinet  zmath
107. A. V. Andrianov, V. N. Temlyakov, “Best $m$-term approximation of functions from classes $MW^r_{q,\alpha}$”, Approximation theory IX, Vol. I (Nashville, TN, 1998), Innov. Appl. Math., Vanderbilt Univ. Press, Nashville, TN, 1998, 7–14  mathscinet  zmath
108. V. N. Temlyakov, “On two problems in the multivariate approximation”, East J. Approx., 4:4 (1998), 505–514  mathscinet  zmath
109. V. N. Temlyakov, “Greedy algorithm and $m$-term trigonometric approximation”, Constr. Approx., 14:4 (1998), 569–587  crossref  mathscinet  zmath  isi (cited: 59)  scopus (cited: 63)

   1997
110. S. A. Telyakovskii, V. N. Temlyakov, “Convergence of multiple Fourier series for functions of bounded variation”, Math. Notes, 61:4 (1997), 484–494  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
111. A. V. Andrianov, V. N. Temlyakov, “On Two Methods of Generalization of Properties of Univariate Function Systems to Their Tensor Product”, Proc. Steklov Inst. Math., 219 (1997), 25–35  mathnet  mathscinet  zmath
112. R. A. DeVore, V. N. Temlyakov, “Nonlinear approximation in finite-dimensional spaces”, J. Complexity, 13:4 (1997), 489–508  crossref  mathscinet  zmath  isi (cited: 14)  scopus (cited: 16)

   1996
113. R. A. DeVore, V. N. Temlyakov, “Some remarks on greedy algorithms”, Adv. Comput. Math., 5:2-3 (1996), 173–187  crossref  mathscinet  zmath  isi (cited: 296)
114. V. N. Temlyakov, “An Inequality for Trigonometric Polynomials and its Application for Estimating the Kolmogorov Widths”, Corrected reprint of “An inequality for trigonometric polynomials and its application for estimating the Kolmogorov widths” [East J. Approx. 2 (1996), no. 1, 89–98], East J. Approx., 2:2 (1996), 253–262  mathscinet  zmath

   1995
115. B. S. Kashin, V. N. Temlyakov, “Estimate of approximate characteristics for classes of functions with bounded mixed derivative”, Math. Notes, 58:6 (1995), 1340–1342  mathnet  crossref  mathscinet  zmath  isi (cited: 9)  scopus (cited: 6)
116. R. A. DeVore, V. N. Temlyakov, “Nonlinear approximation by trigonometric sums”, J. Fourier Anal. Appl., 2:1 (1995), 29–48  crossref  mathscinet  zmath  scopus (cited: 58)
117. V. N. Temlyakov, “An inequality for trigonometric polynomials and its application for estimating the entropy numbers”, J. Complexity, 11:2 (1995), 193–307  crossref  mathscinet  isi (cited: 20)  scopus (cited: 25)
118. V. N. Temlyakov, “Some inequalities for multivariate Haar polynomials”, East J. Approx., 1:1 (1995), 61–72  mathscinet  zmath
119. O. V. Besov, S. V. Bochkarev, V. S. Vladimirov, E. A. Volkov, V. K. Dzyadyk, V. A. Il'in, B. S. Kashin, N. P. Korneichuk, L. D. Kudryavtsev, O. A. Oleinik, Yu. S. Osipov, S. I. Pokhozhaev, S. B. Stechkin, S. A. Telyakovskii, V. N. Temlyakov, P. L. Ul'yanov, “Sergei Mikhailovich Nikol'skii (on his ninetieth birthday)”, Russian Math. Surveys, 50:6 (1995), 1321–1327  mathnet  crossref  mathscinet  adsnasa  isi

   1994
120. B. S. Kashin, V. N. Temlyakov, “On best $m$-term approximations and the entropy of sets in the space $L_1$”, Math. Notes, 56:5 (1994), 1137–1157  mathnet  crossref  mathscinet  zmath  isi (cited: 49)  scopus (cited: 20)
121. R. A. DeVore, P. P. Petrushev, V. N. Temlyakov, “Multivariate trigonometric polynomial approximations with frequencies from the hyperbolic cross”, Math. Notes, 56:3 (1994), 900–918  mathnet  mathscinet  zmath  isi (cited: 1)

   1995
122. V. N. Temlyakov, “On error estimates for cubature formulas”, Proc. Steklov Inst. Math., 207 (1995), 299–309  mathnet  mathscinet  zmath

   1994
123. R. DeVore, V. N. Temlyakov, “The role of approximation and smoothness spaces in compression and noise removal”, Information theory and statistics (IEEE-IMS Workshop on Statistics), Proceedings, 1994, 52
124. O. V. Besov, L. D. Kudryavtsev, S. M. Nikol'skii, S. B. Stechkin, V. N. Temlyakov, P. L. Ul'yanov, “Sergei Aleksandrovich Telyakovskii (on his sixtieth birthday)”, Russian Math. Surveys, 49:2 (1994), 189–191  mathnet  crossref  mathscinet  adsnasa  isi  scopus

   1993
125. V. N. Temlyakov, Approximation of periodic functions, Comput. Math. Anal. Ser., Nova Science Publishers, Inc., Commack, NY, 1993 , x+419 pp.  mathscinet  zmath
126. V. N. Temlyakov, “Universality of the Fibonacci cubature formulas”, Methods of approximation theory in complex analysis and mathematical physics (Leningrad, 1991), Lecture Notes in Math., 1550, Springer, Berlin, 1993, 178–184  crossref  mathscinet  zmath
127. V. N. Temlyakov, “On approximate recovery of functions with bounded mixed derivative”, J. Complexity, 9:1 (1993), 41–59  crossref  mathscinet  zmath  scopus (cited: 46)

   1992
128. V. N. Temlyakov, “Estimates of best bilinear approximations of functions and approximation numbers of integral operators”, Math. Notes, 51:5 (1992), 510–517  mathnet  crossref  mathscinet  zmath  isi (cited: 10)  scopus (cited: 4)

   1993
129. V. N. Temlyakov, “Bilinear approximation and related questions”, Proc. Steklov Inst. Math., 194 (1993), 245–265  mathnet  mathscinet  zmath

   1992
130. V. N. Temlyakov, “On estimates of approximation numbers and best bilinear approximation”, Constr. Approx., 8:1 (1992), 23–33  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 3)

   1993
131. V. N. Temlyakov, “Estimates of the errors of Fibonacci quadrature formulae on classes of functions with bounded derivative”, Proc. Steklov Inst. Math., 200 (1993), 359–367  mathnet  mathscinet  zmath

   1991
132. V. N. Temlyakov, “On Universal Cubature Formulas”, Soviet Math. Dokl., 43 (1991), 39–42  mathnet  mathscinet  zmath

   1990
133. V. N. Temlyakov, “On estimates for the widths of classes of infinitely differentiable functions”, Mat. Zametki, 47:5 (1990), 155–157  mathnet  mathscinet  zmath

   1992
134. V. N. Temlyakov, “On a way of obtaining lower estimates for the errors of quadrature formulas”, Math. USSR-Sb., 71:1 (1992), 247–257  mathnet  crossref  mathscinet  zmath  adsnasa  isi (cited: 27)  scopus (cited: 18)
135. V. N. Temlyakov, “On the behavior of the partial sums, over hyperbolic crosses, of Fourier series of periodic functions of several variables”, Proc. Steklov Inst. Math., 192 (1992), 209–218  mathnet  mathscinet  zmath

   1989
136. V. N. Temlyakov, “Error estimates of quadrature formulas for classes of functions with bounded mixed derivative”, Math. Notes, 46:2 (1989), 663–668  mathnet  crossref  mathscinet  zmath  isi  scopus (cited: 2)

   1990
137. V. N. Temlyakov, “Estimates for the asymptotic characteristics of classes of functions with bounded mixed derivative or difference”, Proc. Steklov Inst. Math., 189 (1990), 161–197  mathnet  mathscinet  zmath
138. V. N. Temlyakov, “Bilinear approximation and applications”, Proc. Steklov Inst. Math., 187 (1990), 221–248  mathnet  mathscinet  zmath

   1989
139. V. N. Temlyakov, “Approximation of Functions of Several Variables by Trigonometric Polynomials with Harmonics from Hyperbolic Crosses”, Ukranian Math. J., 41 (1989), 451–456  crossref  mathscinet  zmath  scopus

   1988
140. V. N. Temlyakov, “Approximation by elements of a finite-dimensional subspace of functions from various Sobolev or Nikol'skii spaces”, Math. Notes, 43:6 (1988), 444–454  mathnet  crossref  mathscinet  zmath  isi (cited: 7)  scopus (cited: 5)

   1989
141. V. N. Temlyakov, “Estimates for the best bilinear approximations of periodic functions”, Proc. Steklov Inst. Math., 181 (1989), 275–293  mathnet  mathscinet  zmath

   1988
142. V. N. Temlyakov, “Best bilinear approximation and connected questions”, Constructive theory of functions (Varna, 1987), Publ. House Bulgar. Acad. Sci., Sofia, 1988, 448–454  mathscinet  zmath

   1989
143. V. N. Temlyakov, “On Estimates of $\varepsilon$-Entropy and Widths of Classes of Functions with Bounded Mixed Derivative or Difference”, Soviet Math. Dokl., 38 (1989), 84–87  mathnet  mathscinet  zmath
144. V. N. Temlyakov, “Estimates of the best bilinear approximations of functions of two variables and some of their applications”, Math. USSR-Sb., 62:1 (1989), 95–109  mathnet  crossref  mathscinet  zmath  scopus (cited: 4)
145. V. N. Temlyakov, “On estimates of the best bilinear approximations of periodic functions and singular numbers of integral operators”, Proc. Steklov Inst. Math., 180 (1989), 252–253  mathnet  mathscinet  zmath

   1987
146. V. N. Temlyakov, “On the widths of function classes”, Soviet Math. Dokl., 35 (1987), 636–642  mathnet  mathscinet  zmath
147. V. N. Temlyakov, “Approximation of periodic functions of several variables by bilinear forms”, Math. USSR-Izv., 28:1 (1987), 133–150  mathnet  crossref  mathscinet  zmath  scopus (cited: 2)

   1989
148. V. N. Temlyakov, “Approximations of functions with bounded mixed derivative”, Proc. Steklov Inst. Math., 178 (1989), 1–121  mathnet  mathscinet  zmath

   1987
149. V. N. Temlyakov, “Approximation of periodic functions of several variables by combinations of functions that depend on a smaller number of variables”, Proc. Steklov Inst. Math., 173 (1987), 263–272  mathnet  mathscinet  zmath

   1986
150. V. N. Temlyakov, “On best bilinear approximations of periodic functions of several variables”, Soviet Math. Dokl., 33 (1986), 96–99  mathnet  mathscinet  zmath
151. V. N. Temlyakov, “Reconstruction of periodic functions of several variables from the values at the nodes of number-theoretic nets”, Anal. Math., 12:4 (1986), 287–305 (in Russian)  crossref  mathscinet  zmath  scopus
152. V. N. Temlyakov, “Approximation of periodic functions of several variables by trigonometric polynomials, and widths of some classes of functions”, Math. USSR-Izv., 27:2 (1986), 285–322  mathnet  crossref  mathscinet  zmath  scopus (cited: 5)

   1985
153. V. N. Temlyakov, “Quadrature formulae and recovery of number-theoretical nets from nodal values for classes of functions with small degree of smoothness”, Russian Math. Surveys, 40:4 (1985), 223–224  mathnet  crossref  zmath  adsnasa  isi (cited: 4)  scopus (cited: 4)

   1987
154. V. N. Temlyakov, “Approximate recovery of periodic functions of several variables”, Math. USSR-Sb., 56:1 (1987), 249–261  mathnet  crossref  mathscinet  zmath  scopus (cited: 21)
155. V. N. Temlyakov, “Asymptotic behavior of best approximations of individual functions”, Proc. Steklov Inst. Math., 172 (1987), 341–352  mathnet  mathscinet  zmath

   1985
156. V. N. Temlyakov, “On the approximate reconstruction of periodic functions of several variables”, Soviet Math. Dokl., 31 (1985), 246–249  mathnet  mathscinet  zmath

   1984
157. V. N. Temlyakov, “On the approximation of periodic functions of several variables”, Soviet Math. Dokl., 30 (1984), 659–662  mathnet  mathscinet  zmath

   1985
158. V. N. Temlyakov, “Relations between best approximations of functions analytic in the bidisk”, Proc. Steklov Inst. Math., 164 (1985), 217–224  mathnet  mathscinet  zmath

   1983
159. V. N. Temlyakov, “Approximation of functions with a bounded mixed difference by trigonometric polynomials, and the widths of some classes of functions”, Math. USSR-Izv., 20:1 (1983), 173–187  mathnet  crossref  mathscinet  zmath  scopus (cited: 5)

   1982
160. V. N. Temlyakov, “Widths of some classes of functions of several variables”, Soviet Math Dokl., 26 (1982), 619–622  mathnet  mathscinet  mathscinet  zmath
161. V. N. Temlyakov, “On absolute summation of Fourier series by subsequences”, Anal. Math., 8:1 (1982), 71–77  crossref  mathscinet  zmath  scopus (cited: 2)

   1981
162. V. N. Temlyakov, “Approximation of functions from the Lipschitz class by algebraic polynomials”, Math. Notes, 29:4 (1981), 306–309  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  scopus
163. V. N. Temlyakov, “Relations between best approximations of functions of two variables”, Math. Notes, 29:1 (1981), 51–58  mathnet  crossref  mathscinet  zmath  isi  scopus

   1983
164. V. N. Temlyakov, “Approximation of continuous functions by trigonometric polynomials”, Proc. Steklov Inst. Math., 157 (1983), 213–228  mathnet  mathscinet  zmath

   1980
165. V. N. Temlyakov, “On the approximation of periodic functions of several variables with bounded mixed difference”, Soviet Math. Dokl., 22 (1980), 131–135  mathnet  mathscinet  mathscinet  zmath

   1982
166. V. N. Temlyakov, “Approximation of periodic functions of several variables with bounded mixed difference”, Math. USSR-Sb., 41:1 (1982), 53–66  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  scopus (cited: 6)

   1983
167. V. N. Temlyakov, “Approximation of periodic functions of several variables with a bounded mixed derivative”, Proc. Steklov Inst. Math., 156 (1983), 255–283  mathnet  mathscinet  zmath

   1981
168. V. N. Temlyakov, “On the question of the asymptotic behavior of best approximations of continuous functions”, Math. USSR-Sb., 38:3 (1981), 365–380  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  scopus

   1979
169. V. N. Temlyakov, “Approximation of periodic functions of several variables with bounded mixed derivative”, Soviet Math. Dokl., 20 (1979), 1032–1035  mathnet  mathscinet  mathscinet  zmath

   1977
170. V. N. Temlyakov, “Asymptotic behavior of best approximations of continuous functions”, Math. USSR-Izv., 11:3 (1977), 551–569  mathnet  crossref  mathscinet  zmath  scopus (cited: 3)
171. V. N. Temlyakov, “Order of growth of the degrees of a polynomial basis of a space of continuous functions”, Math. Notes, 22:5 (1977), 888–898  mathnet  crossref  mathscinet  zmath  scopus
172. V. N. Temlyakov, “The localization of approximations of functions by trigonometric polynomials”, Anal. Math., 3:2 (1977), 151–169 , in Russian  crossref  mathscinet  zmath  scopus

   1976
173. V. N. Temljakov, “On the asymptotic behavior of best approximations of continuous functions”, Soviet Math. Dokl., 17 (1976), 739–743  mathnet  mathscinet  mathscinet  zmath
174. V. N. Temlyakov, “On best approximation of functions of two variables”, Anal. Math., 2:3 (1976), 231–234  crossref  mathscinet  zmath  scopus

   1975
175. V. N. Temljakov, “Best approximations for functions of two variables”, Soviet Math. Dokl., 16 (1975), 1051–1055  mathnet  mathscinet  mathscinet  zmath

   1974
176. V. N. Temlyakov, “On uniqueness of the polynomial of best approximation of the function $\cos kx$ by trigonometric polynomials in the $L$ metric”, Math. Notes, 15:5 (1974), 436–441  mathnet  crossref  mathscinet  zmath  scopus

Presentations in Math-Net.Ru
1. Неравенства типа Лебега в гриди аппроксимации
V. N. Temlyakov
Seminar on Theory of Functions of Real Variables
April 26, 2019 18:30
2. Теоретическая и прикладная математика. Несколько примеров из многомерного приближения
V. N. Temlyakov
Summer School "Contemporary Mathematics" named Vitaly Arnold, 2018
July 20, 2018 09:30   
3. Численное интегрирование и смежные вопросы
V. N. Temlyakov
Seminar on Approximation Theory
May 24, 2018 10:30
4. Дискретизация интегральных норм
V. N. Temlyakov
Seminar on Theory of Functions of Real Variables
March 16, 2018 18:30
5. Sparse approximation with respect to the trigonometric system
V. N. Temlyakov
International conference on Function Spaces and Approximation Theory dedicated to the 110th anniversary of S. M. Nikol'skii
May 27, 2015 10:00   

Books in Math-Net.Ru
  1. V. N. Temlyakov, Approximations of functions with bounded mixed derivative, Trudy Mat. Inst. Steklov., 178, ed. S. M. Nikol'skii, 1986, 113 с.
    http://mi.mathnet.ru/book1159

Organisations
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021