2000 character limit reached
Convergence and rate of convergence of some greedy algorithms in convex optimization
Published 10 Dec 2014 in stat.ML and math.NA | (1412.3297v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
