Greedy Strategies for Convex Optimization
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.