Rescaled Pure Greedy Algorithm for Convex Optimization
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 14 May 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.