Acceleration by stepsize hedging: Silver Stepsize Schedule for smooth convex optimization
We provide a concise, self-contained proof that the Silver Stepsize Schedule proposed in our companion paper directly applies to smooth (non-strongly) convex optimization. Specifically, we show that with these stepsizes, gradient descent computes an ε -minimizer in O ( ε - log ρ 2 ) = O ( ε - 0.7864...
Main Authors: | Altschuler, Jason M., Parrilo, Pablo A. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg
2024
|
Online Access: | https://hdl.handle.net/1721.1/157702 |
Similar Items
-
Acceleration by Stepsize Hedging: Multi-Step Descent and the Silver Stepsize Schedule
by: Altschuler, Jason, et al.
Published: (2025) -
A barrier-based smoothing proximal point algorithm for NCPs over closed convex cones
by: Chua, Chek Beng., et al.
Published: (2013) -
The computational complexity of finding stationary points in non-convex optimization
by: Hollender, A, et al.
Published: (2024) -
Shapes and recession cones in mixed-integer convex representability
by: Zadik, Ilias, et al.
Published: (2024) -
Mean‐variance hedging with basis risk
by: Xue, Xiaole, et al.
Published: (2021)