7 citations · 11 across the 3 of their papers we have counts for
3 papers
math.MG2013
An inequality for the entropy numbers and its application
Vladimir Temlyakov
We prove an inequality for the entropy numbers in terms of nonlinear Kolmogorov's widths. This inequality is in a spirit of known inequalities of this type and it is adjusted to th…
stat.ML2012★ 4 cited
Greedy expansions in convex optimization
V. N. Temlyakov
This paper is a follow up to the previous author's paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation…
stat.ML2012★ 7 cited
Greedy approximation in convex optimization
V. N. Temlyakov
We 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…