48 citations · 191 across the 37 of their papers we have counts for
5 papers · 1 filter
Dictionary descent in optimization
Vladimir Temlyakov
The problem of convex optimization is studied. Usually in convex optimization the minimization is over a d-dimensional domain. Very often the convergence rate of an optimization al…
Convergence and rate of convergence of some greedy algorithms in convex optimization
Vladimir Temlyakov
The paper gives a systematic study of the approximate versions of three greedy-type algorithms that are widely used in convex optimization. By approximate version we mean the one w…
Nonlinear tensor product approximation of functions
D. Bazarkhanov, V. Temlyakov
We are interested in approximation of a multivariate function by linear combinations of products of univariate functions , $i…
Convex optimization on Banach Spaces
R. A. DeVore, V. N. Temlyakov
Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space . Along with algorithms that use exact evaluations, algorithms…
Chebushev Greedy Algorithm in convex optimization
Vladimir Temlyakov
Chebyshev Greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces. We apply this algorithm for co…