Emergent Mind
Convergence and rate of convergence of some greedy algorithms in convex optimization
(1412.3297)
Published Dec 10, 2014
in
stat.ML
and
math.NA
Abstract
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.