2 papers
math.OC2026
On the Complexity of BFGS Method for Smooth Convex Optimization
Lijun Ding, Jinwen Yang, Baoyu Zhou
We study the BFGS method with an Armijo-Wolfe line search for minimizing convex functions with Lipschitz-continuous gradients, without assuming strong convexity. We establish a glo…
math.OC2026
Optimal Two-Step Stepsize Schedule for Stochastic Gradient Methods
Luwei Bai, Baoyu Zhou
Structured nonconstant large stepsizes can improve the convergence of gradient descent in the deterministic setting. However, in stochastic optimization, aggressive stepsizes can a…