arXiv:1401.1754 Abstract | arXiv Analytics

arXiv:1401.1754 [math.NA]Abstract References Reviews Resources

Greedy Strategies for Convex Optimization

Published 2014-01-08Version 1

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$.

Categories: math.NA

Keywords: greedy strategies, convex optimization, uniform convexity, hilbert space, convex function

Related articles: Most relevant | Search more

arXiv:2505.05134 [math.NA] (Published 2025-05-08)

Matrices over a Hilbert space and their low-rank approximation

Stanislav Budzinskiy

arXiv:2001.05530 [math.NA] (Published 2020-01-15)

Biorthogonal greedy algorithms in convex optimization

Anton Dereventsov, Vladimir Temlyakov

arXiv:2410.17729 [math.NA] (Published 2024-10-23)

Comparing the ill-posedness for linear operators in Hilbert spaces

Peter Mathé, Bernd Hofmann