Vladimir Temlyakov

Prof. Dr. Vladimir Temlyakov


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 August 2018 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
VTVladimir Temlyakov
Vladimir Temlyakov

21 January 2015 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
VTVladimir Temlyakov
Vladimir Temlyakov

24 January 2023 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
BKB. Kashin
B. Kashin
SKS. Konyagin
S. Konyagin
VTVladimir Temlyakov
Vladimir Temlyakov

6 June 2016 in Constructive Approximation
Verified
Journal Article
Closed access
PDF file
VTVladimir Temlyakov
Vladimir Temlyakov

14 February 2015 in Foundations of Computational Mathematics
Verified
Journal Article
Closed access
PDF file
RDR. A. DeVore
R. A. DeVore
VTVladimir Temlyakov
Vladimir Temlyakov

1 May 2014 in Proceedings of the Steklov Institute of Mathematics
Verified
Journal Article
Closed access
PDF file
VTVladimir Temlyakov
Vladimir Temlyakov
This paper is a follow-up to the author’s previous paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation for finding sparse solutions of convex optimization problems. We modified there the three most popular greedy algorithms in nonlinear approximation in Banach spaces-Weak Chebyshev Greedy Algorithm, Weak Greedy Algorithm with Free Relaxation, and Weak Relaxed Greedy Algorithm-for solving convex optimization problems. We continue to study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements from a given system of elements. There is an increasing interest in building such sparse approximate solutions using different greedy-type algorithms. In this paper we concentrate on greedy algorithms that provide expansions, which means that the approximant at the mth iteration is equal to the sum of the approximant from the previous, (m − 1)th, iteration and one element from the dictionary with an appropriate coefficient. The problem of greedy expansions of elements of a Banach space is well studied in nonlinear approximation theory. At first glance the setting of a problem of expansion of a given element and the setting of the problem of expansion in an optimization problem are very different. However, it turns out that the same technique can be used for solving both problems. We show how the technique developed in nonlinear approximation theory, in particular, the greedy expansions technique, can be adjusted for finding a sparse solution of an optimization problem given by an expansion with respect to a given dictionary.