A restarted accelerated gradient method and the proximal bundle method are both shown to be instances of accelerating and non-accelerating inexact proximal point frameworks, with optimal iteration complexity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Unifying restart accelerated gradient and proximal bundle methods
A restarted accelerated gradient method and the proximal bundle method are both shown to be instances of accelerating and non-accelerating inexact proximal point frameworks, with optimal iteration complexity.