Rescaled Pure Greedy Algorithm for Convex Optimization
classification
🧮 math.OC
keywords
convexgreedyoptimizationalgorithmbanachbehaviorconvergentfunction
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.