Skip to content

Opening book details…

Can I read Convergence and Rate of Convergence of Some Greedy Algorithms in Convex Optimization on EtoBox?

Convergence and Rate of Convergence of Some Greedy Algorithms in Convex Optimization by Temlyakov, Vladimir is a scholarly article available to read on EtoBox.

What is Convergence and Rate of Convergence of Some Greedy Algorithms in Convex Optimization about?

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 where some of evaluations are made with an error. Importance of such versions of greedy-type algorithms in convex optimization and in approximation theory was emphasized in previous literature.

Author
Temlyakov, Vladimir
Published
2014
Language
EN

More by Temlyakov, Vladimir

Browse all works by Temlyakov, Vladimir