Home page
Font:
A A A
Color:
A A A
Images:
Special mode Special mode Special mode

Clear mode

  Home page
Home page
Russian page
English page
Math-Net.Ru | Web of Science | Scopus | MathSciNet | zbMATH | Web-mail 

   
 About the Institute
 Staff publications
 Administration
 Academic Council
 Dissertation Councils
 Departments
Staff 
 Chair at MIPT
 Seminars
 Conferences
 Events
 Journals and Books
 In memoriam
 Photogallery
 Charter

    Address
8 Gubkina Str. Moscow,
119333, Russia
Tel.: +7(495) 984 81 41
Web site: www.mi-ras.ru
E-mail: steklov@mi-ras.ru

View Map
Directions

   
Temlyakov Vladimir Nikolaevich
(recent publications)
| by years | scientific publications | by types |


1. V. N. Temlyakov, Mat. Sb.  mathnet  crossref

   2026
2. F. Dai, V. N. Temlyakov, “A survey on sampling recovery by greedy algorithms and $\ell_p$-minimization”, Russian Math. Surveys, 81:4 (2026), 671–725  mathnet  crossref  crossref

   2025
3. V. N. Temlyakov, “A remark on constructive covering of a ball of finite-dimensional Banach space”, Sb. Math., 216:7 (2025), 965–976  mathnet  crossref  crossref  mathscinet  adsnasa  isi  scopus
4. A. P. Solodov, V. N. Temlyakov, “Sampling recovery on function classes with a structural condition”, Math. Notes, 117:4 (2025), 603–616  mathnet  crossref  crossref  mathscinet  isi  scopus
5. E. D. Kosov, V. N. Temlyakov, “Sampling recovery of functions with mixed smoothness”, Adv. Oper. Theory, 10 (2025), 49, 17 pp.  mathnet  crossref  mathscinet  isi 2
6. E. D. Kosov, V. N. Temlyakov, “Bounds for the sampling discretization error and their applications to the universal sampling discretization”, J. Complexity, 90 (2025), 101958, 28 pp.  mathnet  crossref  mathscinet  isi 5
7. A. V. Gasnikov, V. N. Temlyakov, “Some lower bounds for optimal sampling recovery of functions with mixed smoothness”, Sb. Math., 216:11 (2025), 1575–1591  mathnet  crossref  crossref  mathscinet  mathscinet  adsnasa  isi  scopus
8. A. Yu. Shadrin, V. N. Temlyakov, S. Yu. Tikhonov, “Sparse Approximation and Sampling Recovery on Function Classes with a Structural Condition”, Proc. Steklov Inst. Math., 331 (2025), 270–283  mathnet  crossref  crossref  isi  scopus
9. Russian Math. Surveys, 80:5 (2025), 763–841  mathnet  crossref  crossref  mathscinet  adsnasa  isi  scopus
10. B. S. Kashin, S. V. Konyagin, V. N. Temlyakov, V. N. Chubarikov, L. A. Tolokonnikov, N. N. Dobrovol'skii, A. A. Kochetygov, I. M. Burkin, V. P. Baranov, S. A. Skobel'tsyn, E. V. Larkin, D. V. Gorbachev, O. I. Smirnov, N. M. Dobrovol'skii, I. Yu. Rebrova, “Valery Ivanovich Ivanov (7.07.1951 — 2.03.2025)”, Chebyshevskii Sb., 26:1 (2025), 258–262  mathnet  crossref

   2024
11. V. N. Temlyakov, “Rate of convergence of Thresholding Greedy Algorithms”, Sb. Math., 215:2 (2024), 275–289  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  scopus
12. F. Dai, V. Temlyakov, “Random points are good for universal discretization”, J. Math. Anal. Appl., 529:1 (2024), 127570, 28 pp.  mathnet  crossref  mathscinet  isi 24
13. I. V. Limonova, Yu. V. Malykhin, V. N. Temlyakov, “One-sided discretization inequalities and sampling recovery”, Russian Math. Surveys, 79:3 (2024), 515–545  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  scopus
14. Egor Kosov, Vladimir Temlyakov, “Sampling discretization of the uniform norm and applications”, J. Math. Anal. Appl., 538:2 (2024), 128431, 25 pp., arXiv: 2306.14207  mathnet  crossref  mathscinet 6
15. V. N. Temlyakov, “Sparse sampling recovery in integral norms on some function classes”, Sb. Math., 215:10 (2024), 1406–1425  mathnet  crossref  crossref  mathscinet  adsnasa  isi  scopus
16. A. V. Gasnikov, V. N. Temlyakov, “On greedy approximation in complex Banach spaces”, Russian Math. Surveys, 79:6 (2024), 975–990  mathnet  crossref  crossref  mathscinet  adsnasa  isi  scopus

   2023
17. B. Kashin, S. Konyagin, V. Temlyakov, “Sampling discretization of the uniform norm”, Constr. Approx., 57 (2023), 663–694, arXiv: 2104.01229v2  mathnet  crossref  mathscinet 18
18. V. N. Temlyakov, “On Universal Sampling Recovery in the Uniform Norm”, Proc. Steklov Inst. Math., 323 (2023), 206–216  mathnet  crossref  crossref  mathscinet  isi  scopus
19. F. Dai, E. Kosov, V. Temlyakov, “Some improved bounds in sampling discretization of integral norms”, J. Funct. Anal., 285 (2023), 109951, 40 pp.  mathnet  crossref  mathscinet 8
20. F. Dai, V. N. Temlyakov, “Universal Sampling Discretization”, Constr. Approx., 58 (2023), 589–613  mathnet  crossref  mathscinet 12
21. F. Dai, A. Prymak, A. Yu. Shadrin, V. N. Temlyakov, S. Yu. Tikhonov, “On the cardinality of lower sets and universal discretization”, J. Complexity, 76 (2023), 101726, 16 pp.  mathnet  crossref  mathscinet 2
22. V. N. Temlyakov, “Sampling discretization error of integral norms for function classes with small smoothness”, J. Approx. Theory, 293 (2023), 105913–15  mathnet  crossref  mathscinet 2

   2022
23. Teoriya priblizhenii, funktsionalnyi analiz i prilozheniya, Sbornik statei. K 70-letiyu akademika Borisa Sergeevicha Kashina, Trudy MIAN, 319, ed. S. V. Konyagin, M. I. Dyachenko, V. N. Temlyakov, M. R. Gabdullin, K. S. Ryutin, MIAN, M., 2022, 328 pp.  mathnet
24. F. Dai, V. N. Temlyakov, “Sampling Discretization of Integral Norms and Its Application”, Proc. Steklov Inst. Math., 319 (2022), 96–108  mathnet  crossref  crossref  mathscinet  isi  scopus
25. V. N. Temlyakov, “Numerical integration and discrepancy under smoothness assumption and without it”, Constr. Approx., 55 (2022), 743–771  mathnet  crossref  mathscinet  isi  scopus 2
26. B. Kashin, E. Kosov, I. Limonova, V. Temlyakov, “Sampling discretization and related problems”, J. Complexity, 71 (2022), 101653, 55 pp.  mathnet  crossref  mathscinet  zmath  scopus 48
27. I. Limonova, V. Temlyakov, “On sampling discretization in $L_2$”, J. Math. Anal. Appl., 515:2 (2022), 126457, 14 pp.  mathnet  crossref  mathscinet 31
28. A. V. Dereventsov, V. N. Temlyakov, “Biorthogonal Greedy Algorithms in convex optimization”, Appl. Comput. Harmon. Anal., 60 (2022), 489–511, arXiv: 2001.05530  mathnet  crossref  mathscinet 16
29. Vladimir N. Temlyakov, Tino Ullrich, “Approximation of functions with small mixed smoothness in the uniform norm”, J. Approx. Theory, 277 (2022), 105718, 23 pp., arXiv: 2012.11983  mathnet  crossref  mathscinet 18
30. Vladimir Temlyakov, “A remark on entropy numbers”, Studia Math., 263 (2022), 199–208, arXiv: 2008.13030  mathnet  crossref  mathscinet 2
31. V. I. Berdyshev, O. V. Besov, B. S. Kashin, S. V. Konyagin, Yu. V. Malykhin, K. I. Oskolkov, A. S. Telyakovskii, D. S. Telyakovskii, V. N. Temlyakov, N. N. Kholshchevnikova, “Sergei Aleksandrovich Telyakovskii”, Proc. Steklov Inst. Math. (Suppl.), 319, suppl. 1 (2022), S7–S11  mathnet  crossref  crossref  mathscinet  isi  isi  elib

   2021
32. 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
33. 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  mathscinet  isi  scopus 14
34. 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  mathscinet  zmath  adsnasa  isi  elib  scopus
35. 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  mathscinet  zmath  adsnasa  isi
36. F. Dai, A. Prymak, A. Shadrin, V. Temlyakov, S. Tikhonov, “Entropy numbers and Marcinkiewicz-type discretization”, J. Funct. Anal., 281:6 (2021), 109090, 25 pp.  mathnet  crossref  mathscinet  isi  scopus 28
37. V. Temlyakov, “On optimal recovery in $L_2$”, J. Complexity, 65 (2021)  mathnet  crossref  isi  scopus 45
38. F. Dai, A. Prymak, A. Shadrin, V. Temlyakov, S. Tikhonov, “Sampling discretization of integral norms”, Constr. Approx., 54:3 (2021), 455–471  mathnet  crossref  isi  scopus 19
39. V. Temlyakov, T. Ullrich, “Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness”, J. Complexity, 67 (2021), 101575, 19 pp.  mathnet  crossref  mathscinet  isi  scopus 28

   2020
40. 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 2
41. L. Burusheva, V. Temlyakov, “Sparse approximation of individual functions”, J. Approx. Theory, 259 (2020), 105471, 12 pp.  mathnet  crossref  mathscinet  isi  scopus 4

   2019
42. V. N. Temlyakov, “Smooth fixed volume discrepancy, dispersion, and related problems”, J. Approx. Theory, 237 (2019), 113–134  mathnet  crossref  mathscinet  zmath  isi  scopus 4
43. 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  zmath  adsnasa  isi  elib  scopus
44. 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  scopus 17

   2018
45. V.N. Temlyakov, “Universal discretization”, J. Complexity, 47 (2018), 97–109  mathnet  crossref  mathscinet  isi  scopus 18
46. V. N. Temlyakov, “The Marcinkiewicz–type discretization theorems”, Constr. Approx., 48:2 (2018), 337–369  mathnet  crossref  mathscinet  isi  scopus 45
47. 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  zmath  adsnasa  isi  elib  scopus
48. 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  elib  scopus
49. V. Temlyakov, Multivariate approximation, Cambridge Monogr. Appl. Comput. Math., 32, Cambridge University Press, Cambridge, 2018, 550 pp.  mathscinet  zmath
50. 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 159

   2017
51. V. Temlyakov, “On the entropy numbers of the mixed smoothness function classes”, J. Approx. Theory, 217 (2017), 26–56  mathnet  crossref  mathscinet  isi  elib  scopus 19
52. V. Temlyakov, “Constructive Sparse Trigonometric Approximation for Functions with Small Mixed Smoothness”, Constr. Approx., 45 (2017), 467–495  mathnet  crossref  mathscinet  isi  elib  scopus 14
53. 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  elib  scopus 8

   2016
54. V. N. Temlyakov, “Dictionary descent in optimization”, Anal. Math., 42:1 (2016), 69–89  mathnet  crossref  mathscinet  isi  elib  scopus 8
55. 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  elib  elib  scopus
56. 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  elib  scopus 4
57. V. N. Temlyakov, “Sparse approximation by greedy algorithm”, Springer Proc. Math. Statist., 177, 2016, 183–215  mathnet  crossref  mathscinet  isi  elib  scopus 1

   2015
58. V. N. Temlyakov, “Greedy approximation in convex optimization”, Constr. Approx., 41:2 (2015), 269–296  mathnet  crossref  mathscinet  isi  elib  scopus 32
59. D. Bazarkhanov, V. Temlyakov, “Nonlinear tensor product approximation of functions”, J. Complexity, 31:6 (2015), 867–884  mathnet  crossref  mathscinet  isi  elib  scopus 10
60. 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  zmath  adsnasa  isi  elib  elib  scopus

   2014
61. V. N. Temlyakov, “Greedy Expansions in Convex Optimization”, Proc. Steklov Inst. Math., 284 (2014), 244–262  mathnet  crossref  crossref  isi  elib  elib  scopus
62. 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  elib  elib  scopus
63. 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  elib  scopus 25
64. 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 18
65. 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  scopus 5

   2013
66. Proc. Steklov Inst. Math., 280 (2013), 227–239  mathnet  crossref  crossref  mathscinet  isi  elib  elib  scopus
67. 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  elib  elib  scopus
68. V. N. Temlyakov, “An inequality for the entropy numbers and its application”, J. Approx. Theory, 173 (2013), 110–121  mathnet  crossref  mathscinet  zmath  isi  elib  scopus 17
69. 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 4
70. 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
71. 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
72. 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  scopus 8

   2012
73. 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  elib  scopus 18
74. S. Dilworth, M. Soto-Bajo, and V. N. Temlyakov, Quasi-greedy bases and Lebesgue-type inequalities, IMI Preprint No 02, 2012, 44 pp.
75. 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  scopus 174
76. E. Liu and V. N. Temlyakov, “Super greedy type algorithms”, Adv. Comput. Math., 37:4 (2012), 493–504  mathnet  crossref  mathscinet  zmath  isi  scopus 8
77. 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  scopus 24

   2011
78. V. Temlyakov, Greedy approximation, Cambridge Monogr. Appl. Comput. Math., 20, Cambridge University Press, Cambridge, 2011, xiv+418 pp.  mathscinet  zmath
79. 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  scopus 12
80. V. N. Temlyakov, P. Zheltov, “On performance of greedy algorithms”, J. Approx. Theory, 163:9 (2011), 1134–1145  crossref  mathscinet  zmath  isi  elib  scopus 30
81. 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
82. 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
83. 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  scopus 15

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


Full list of publications
Home page

© Steklov Mathematical Institute of RAS, 2004–2026