# Rescaled Pure Greedy Algorithm for Convex Optimization

arXiv: https://arxiv.org/abs/1505.03606 · HTML: https://mlsanity.com/paper/1505.03606/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 May 2015.

## Built on by (most cited first, 1 of 1)

- [Kernel-Free Universum Quadratic Surface Twin Support Vector Machines for Imbalanced Data](https://mlsanity.com/paper/2412.01936/) (2024)

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