Rescaled Pure Greedy Algorithm for Convex Optimization

Abstract

We suggest a new greedy strategy for convex optimization in Banach spaces and prove its convergent rates under a suitable behavior of the modulus of uniform smoothness of the objective function.

References in corpus (1)

• Greedy expansions in convex optimization