Logo image
An Optimal First-Order Active-Hull Method for Convex Composite Hölder Smooth Optimization
Preprint   Open access

An Optimal First-Order Active-Hull Method for Convex Composite Hölder Smooth Optimization

Renbo Zhao
arXiv
arXiv
11/07/2026
DOI: 10.48550/arxiv.2611.10916
url
https://doi.org/10.48550/arxiv.2611.10916View
Preprint (Author's original) This preprint has not been evaluated by subject experts through peer review. Preprints may undergo extensive changes and/or become peer-reviewed journal articles. Open Access

Abstract

We consider the problem (P) : minx∈Rn f (x) + g(x) under the Euclidean geometry, where f is convex and (M, ν)-H¨older smooth on Rn, and g is proper, closed and convex on Rn, admits a generalized linear minimization oracle (GLMO), and has bounded domain with diameter D. An first-order active-hull (AH) method has access to both the first-order oracle (FO) of f and the GLMO of g, and outputs a point that lies in the convex hull of all the past GLMO returns. We propose a new first-order AH method for solving (P), which is based on our newly developed “recentered homotopy smoothing framework”. We show that in the high-dimensional regime, this method achieves the optimal FO and GLMO complexties simultaneously for all ν ∈ [0, 1].
Mathematics - Optimization and Control

Details

Metrics

1 Record Views
Logo image