Home page
Home page
Home page
Russian page
English page
Math-Net.Ru | MMS | 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 St. Moscow,
119991, Russia
Tel.: +7(495) 984 81 41
Fax: +7(495) 984 81 39
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 |



   2022
1. 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  mathnet
2. F. Dai, V. N. Temlyakov, “Sampling discretization of integral norms and its application”, Approximation Theory, Functional Analysis, and Applications, Collected papers. On the occasion of the 70th birthday of Academician Boris Sergeevich Kashin, Trudy Mat. Inst. Steklova, 318, Steklov Math. Inst., Moscow, 2022 (to appear)  mathnet
3. V. N. Temlyakov, “Numerical integration and discrepancy under smoothness assumption and without it”, Constr. Approx., 55 (2022), 743–771  mathnet  crossref  isi  scopus;
4. 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;
5. I. Limonova, V. Temlyakov, “On sampling discretization in $L_2$”, J. Math. Anal. Appl., 515:2 (2022), 126457 , 14 pp.  mathnet  crossref;
6. 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;
7. 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;
8. Vladimir Temlyakov, “A remark on entropy numbers”, Studia Math., 263 (2022), 199–208 , arXiv: 2008.13030  mathnet  crossref;

   2021
9. 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 (cited: 2)  elib  scopus (cited: 2)
10. S. Dilworth, G. Garrig'os, E. Hern'andez, D. Kutzarova, V. Temlyakov, “Lebesgue-type inequalities in greedy approximation”, J. Funct. Anal., 280 (2021), 108885 , 37 pp.  mathnet  crossref  mathscinet  isi  scopus (cited: 1);  mathscinet
11. 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  adsnasa  adsnasa  isi  elib  scopus
12. 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  adsnasa  adsnasa  isi
13. 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  isi (cited: 3)  scopus (cited: 4);
14. V. Temlyakov, “On optimal recovery in $L_2$”, J. Complexity, 65 (2021)  mathnet  crossref  isi (cited: 3)  scopus (cited: 7);
15. 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 (cited: 5)  scopus (cited: 5);
16. 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  isi  scopus (cited: 2);

   2020
17. 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 (cited: 1)  scopus (cited: 3);
18. L. Burusheva, V. Temlyakov, “Sparse approximation of individual functions”, J. Approx. Theory, 259 (2020), 105471 , 12 pp.  mathnet  crossref  mathscinet  isi  scopus;  mathscinet

   2019
19. V. N. Temlyakov, “Smooth fixed volume discrepancy, dispersion, and related problems”, J. Approx. Theory, 237 (2019), 113–134  mathnet  crossref  mathscinet  zmath  isi (cited: 3)  scopus (cited: 3)
20. 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  adsnasa  isi (cited: 15)  elib  scopus (cited: 16)
21. 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: 4)

   2018
22. V.N. Temlyakov, “Universal discretization”, J. Complexity, 47 (2018), 97–109  mathnet  crossref  mathscinet  isi (cited: 8)  scopus (cited: 13)
23. V. N. Temlyakov, “The Marcinkiewicz–type discretization theorems”, Constr. Approx., 48:2 (2018), 337–369  mathnet (cited: 2)  crossref  mathscinet  isi (cited: 16)  scopus (cited: 20)
24. 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  adsnasa  isi (cited: 5)  elib  scopus (cited: 6)
25. 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)
26. V. Temlyakov, Multivariate approximation, Cambridge Monogr. Appl. Comput. Math., 32, Cambridge University Press, Cambridge, 2018 , 550 pp.  mathscinet  zmath
27. 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
28. V. Temlyakov, “On the entropy numbers of the mixed smoothness function classes”, J. Approx. Theory, 217 (2017), 26–56  mathnet  crossref  mathscinet  isi (cited: 12)  elib  scopus (cited: 12)
29. 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: 7)
30. 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: 6)

   2016
31. V. N. Temlyakov, “Dictionary descent in optimization”, Anal. Math., 42:1 (2016), 69–89  mathnet  crossref  mathscinet  isi (cited: 5)  elib  scopus (cited: 6)
32. 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: 3)
33. 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: 2)
34. V. N. Temlyakov, “Sparse approximation by greedy algorithm”, Springer Proc. Math. Statist., 177, 2016, 183–215  mathnet  crossref  mathscinet  isi  elib  scopus

   2015
35. V. N. Temlyakov, “Greedy approximation in convex optimization”, Constr. Approx., 41:2 (2015), 269–296  mathnet  crossref  mathscinet  isi (cited: 19)  elib (cited: 5)  scopus
36. 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: 4)
37. 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  adsnasa  isi (cited: 16)  elib  elib  scopus (cited: 4)

   2014
38. 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: 8)
39. 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  adsnasa  isi (cited: 1)  elib  elib  scopus
40. 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: 15)  elib (cited: 5)  scopus (cited: 17)
41. 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: 12)
42. 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
43. Proc. Steklov Inst. Math., 280 (2013), 227–239  mathnet  crossref  crossref  mathscinet  isi  elib  elib  scopus
44. 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)
45. 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: 10)  elib (cited: 1)  scopus (cited: 10)
46. 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)
47. 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
48. 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
49. 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
50. 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: 12)  elib (cited: 2)  scopus (cited: 15)
51. S. Dilworth, M. Soto-Bajo, and V. N. Temlyakov, Quasi-greedy bases and Lebesgue-type inequalities, IMI Preprint No 02, 2012 , 44 pp.
52. 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: 131)  scopus (cited: 150)
53. E. Liu and V. N. Temlyakov, “Super greedy type algorithms”, Adv. Comput. Math., 37:4 (2012), 493–504  mathnet  crossref  mathscinet  zmath  isi (cited: 10)  scopus (cited: 9)
54. 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: 21)

   2011
55. V. Temlyakov, Greedy approximation, Cambridge Monogr. Appl. Comput. Math., 20, Cambridge University Press, Cambridge, 2011 , xiv+418 pp.  mathscinet  zmath
56. 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)
57. 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: 22)
58. 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
59. 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
60. 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
61. 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–2022