arXiv · 2611.19788
Distance-Certified Polyak-type Stepsizes for Subgradient Methods under Hölder Growth
Abstract
In this paper, we consider nonsmooth convex optimization under a H{ö}lder growth condition, with quadratic growth and weak sharp minima as two important special cases. Existing subgradient methods often employ predetermined decaying stepsize schedules, whereas the classical Polyak stepsize selects its stepsize adaptively but requires knowledge of the optimal value. We introduce a new distance-certified subgradient method (\DCSG) that follows a one-step optimization principle analogous to that underlying the Polyak stepsize, without requiring the optimal value. Specifically, \DCSG{} maintains a valid upper certificate for the current squared distance to the solution set. The method selects each stepsize by minimizing the worst-case upper bound on the next squared distance over all distances consistent with this certificate. We show that the resulting minimax problem admits a closed-form solution, yielding an explicit adaptive stepsize update. Under uniformly bounded subgradients, \DCSG{} improves upon the convergence rate of the classical subgradient method and matches the state-of-the-art rates for Lipschitz convex optimization under H{ö}lder growth. In particular, it achieves linear convergence under sharp growth. Numerical experiments illustrate the performance of \DCSG.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kornpholkrit Weraarchakul, Yang Zheng. 2026-11-15. Distance-Certified Polyak-type Stepsizes for Subgradient Methods under Hölder Growth. https://searcharxiv.com/abs/2611.19788
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.