2000 character limit reached
Greedy Strategies for Convex Optimization (1401.1754v1)
Published 8 Jan 2014 in math.NA
Abstract: We investigate two greedy strategies for finding an approximation to the minimum of a convex function $E$ defined on a Hilbert space $H$. We prove convergence rates for these algorithms under suitable conditions on the objective function $E$. These conditions involve the behavior of the modulus of smoothness and the modulus of uniform convexity of $E$.
Sponsor
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.