Список публикаций

Об институте

Научная деятельность

Публикации

Правила оформления научных работ

Администрация

Ученый совет

Диссертационные советы

Отделы

Сотрудники

Аспирантура

Научно-образовательный центр

Адрес института

Адрес: Россия, 119991, Москва, ул. Губкина, д. 8
Тел.: +7(495) 984 81 41
Факс: +7(495) 984 81 39
Сайт: www.mi-ras.ru
E-mail: steklov@mi-ras.ru

Посмотреть карту

Схема проезда

Темляков Владимир Николаевич
(публикации за последние годы)

по годам

научные публикации

по типам



2018
1.	V.N. Temlyakov, “Universal discretization”, J. Complexity, 47 (2018), 97–109 (cited: 3)
2.	V. N. Temlyakov, “The Marcinkiewicz–type discretization theorems”, Constr. Approx., 48:2 (2018), 337–369

2017
3.	V. Temlyakov, “On the entropy numbers of the mixed smoothness function classes”, J. Approx. Theory, 217 (2017), 26–56 (cited: 3) (cited: 4)
4.	V. Temlyakov, “Constructive Sparse Trigonometric Approximation for Functions with Small Mixed Smoothness”, Constr. Approx., 45 (2017), 467–495 (cited: 3) (cited: 3)
5.	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

2016
6.	V. N. Temlyakov, “Dictionary descent in optimization”, Anal. Math., 42:1 (2016), 69–89 (cited: 3) (cited: 3)
7.	В. Н. Темляков, “Сходимость и скорость сходимости некоторых гриди-алгоритмов в выпуклой оптимизации”, Функциональные пространства, теория приближений, смежные разделы математического анализа, Сборник статей. К 110-летию со дня рождения академика Сергея Михайловича Никольского, Тр. МИАН, 293, МАИК, М., 2016, 333–345 (цит.: 1) ; V. N. Temlyakov, “Convergence and rate of convergence of some greedy algorithms in convex optimization”, Proc. Steklov Inst. Math., 293 (2016), 325–337 (cited: 1) (cited: 1)
8.	Vladimir Temlyakov, “Incremental greedy algorithm and its applications in numerical integration” (MCQMC, Leuven, Belgium, April 2014), Springer Proc. Math. Statist., 163, 2016, 557–570 (cited: 1)
9.	V. N. Temlyakov, “Sparse approximation by greedy algorithm”, Springer Proc. Math. Statist., 177, 2016, 183–215

2015
10.	V. N. Temlyakov, “Greedy approximation in convex optimization”, Constr. Approx., 41:2 (2015), 269–296 (cited: 3) (cited: 8) (cited: 5)
11.	D. Bazarkhanov, V. Temlyakov, “Nonlinear tensor product approximation of functions”, J. Complexity, 31:6 (2015), 867–884 (cited: 1) (cited: 3) (cited: 3)
12.	В. Н. Темляков, “Конструктивные разреженные тригонометрические приближения и другие задачи для функций смешанной гладкости”, Матем. сб., 206:11 (2015), 131–160 (цит.: 13) (цит.: 1) (цит.: 8) (цит.: 3); V. N. Temlyakov, “Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness”, Sb. Math., 206:11 (2015), 1628–1656 (cited: 8) (cited: 1)

2014
13.	В. Н. Темляков, “Гриди-разложения в выпуклой оптимизации”, Тр. МИАН, 284 (2014), 252–270 (цит.: 5) (цит.: 6) ; V. N. Temlyakov, “Greedy Expansions in Convex Optimization”, Proc. Steklov Inst. Math., 284 (2014), 244–262 (cited: 6) (cited: 2) (cited: 3)
14.	В. Н. Темляков, “Некогерентные системы и покрытия в конечномерных банаховых пространствах”, Матем. сб., 205:5 (2014), 97–116 (цит.: 1) (цит.: 1) ; V. N. Temlyakov, “Incoherent systems and coverings in finite dimensional Banach spaces”, Sb. Math., 205:5 (2014), 703–721 (cited: 1)
15.	E. D. Livshitz, V. N. Temlyakov, “Sparse approximation and recovery by greedy algorithms”, IEEE Trans. Inform. Theory, 60:7 (2014), 3989–4000 (cited: 4) (cited: 10) (cited: 5) (cited: 12)
16.	V. N. Temlyakov, “Sparse approximation and recovery by greedy algorithms in Banach spaces”, Forum Math. Sigma, 2 (2014), e12 , 26 pp. (cited: 5)
17.	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 (cited: 1) (cited: 2) (cited: 2)

2013
18.	J. L. Nelson, V. N. Temlyakov, “Greedy expansions in Hilbert spaces”, Ортогональные ряды, теория приближений и смежные вопросы, Сборник статей. К 60-летию со дня рождения академика Бориса Сергеевича Кашина, Тр. МИАН, 280, МАИК, М., 2013, 234–246 ; Proc. Steklov Inst. Math., 280 (2013), 227–239
19.	K. Kazarian, V. N. Temlyakov, “Greedy bases in $L^p$ spaces”, Ортогональные ряды, теория приближений и смежные вопросы, Сборник статей. К 60-летию со дня рождения академика Бориса Сергеевича Кашина, Тр. МИАН, 280, МАИК, М., 2013, 188–197 (цит.: 3) (цит.: 1) (цит.: 1) ; K. Kazarian, V. N. Temlyakov, “Greedy bases in $L^p$ spaces”, Proc. Steklov Inst. Math., 280 (2013), 181–190 (cited: 1) (cited: 1) (cited: 1)
20.	V. N. Temlyakov, “An inequality for the entropy numbers and its application”, J. Approx. Theory, 173 (2013), 110–121 (cited: 2) (cited: 5) (cited: 1) (cited: 6)
21.	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 (cited: 3)
22.	V. Temlyakov, “How young we were”, Recent advances in harmonic analysis and applications, Springer Proc. Math. Stat., 25, Springer, New York, 2013, 43–46
23.	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
24.	D. Savu, V. N. Temlyakov, “Lebesgue-type inequalities for greedy approximation in Banach spaces”, IEEE Trans. Inform. Theory, 59:2 (2013), 1098–1106 (cited: 2) (cited: 3) (cited: 3)

2012
25.	D. Bilyk, V. N. Temlyakov and Rui Yu, “Fibonacci sets are good for discrepancy and numerical integration”, J. Complexity, 28:1 (2012), 18–36 (cited: 6) (cited: 8) (cited: 2) (cited: 11)
26.	S. Dilworth, M. Soto-Bajo, and V. N. Temlyakov, Quasi-greedy bases and Lebesgue-type inequalities, IMI Preprint No 02, 2012 , 44 pp.
27.	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 (cited: 14) (cited: 86) (cited: 100)
28.	E. Liu and V. N. Temlyakov, “Super greedy type algorithms”, Adv. Comput. Math., 37:4 (2012), 493–504 (cited: 6) (cited: 5)
29.	S. J. Dilworth, M. Soto-Bajo, V. N. Temlyakov, “Quasi-greedy bases and Lebesgue-type inequalities”, Stud. Math., 211:1 (2012), 41–69 (cited: 7) (cited: 12) (cited: 13)

2011
30.	V. Temlyakov, Greedy approximation, Cambridge Monogr. Appl. Comput. Math., 20, Cambridge University Press, Cambridge, 2011 , xiv+418 pp. (cited: 41)
31.	V. N. Temlyakov, Mingrui Yang, Peixin Ye, “Greedy approximation with regard to non-greedy bases,”, Adv. Comput. Math., 34:3 (2011), 319–337 (cited: 7) (cited: 7) (cited: 8)
32.	V. N. Temlyakov, P. Zheltov, “On performance of greedy algorithms”, J. Approx. Theory, 163:9 (2011), 1134–1145 (cited: 7) (cited: 19) (cited: 6) (cited: 16)
33.	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 (cited: 6)
34.	S. V. Konyagin, Yu. V. Malykhin and V. N. Temlyakov, “On basis sets in Banach spaces”, East J. Approx., 17 (2011), 215–220
35.	J. L. Nelson and V. N. Temlyakov, “On the size of incoherent systems”, J. Approximation Theory, 163:9 (2011), 1238–1245 (cited: 5) (cited: 10) (cited: 12)

2010
36.	V. N. Temlyakov, “Greedy approximation of characteristic functions”, Теория функций и дифференциальные уравнения, Сборник статей. К 105-летию со дня рождения академика Сергея Михайловича Никольского, Тр. МИАН, 269, МАИК, М., 2010, 254–264 ; Proc. Steklov Inst. Math., 269 (2010), 247–258

Полный список публикаций