Two restart-free accelerated first-order methods for nonconvex functions with Lipschitz gradients and Hessians achieve O(ε^{-7/4}) complexity by discretizing a new ODE model, with adaptive Lipschitz estimation in one variant.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Restart-Free Accelerated Algorithm for Non-Convex Minimization: Continuous and Discrete Analysis
Two restart-free accelerated first-order methods for nonconvex functions with Lipschitz gradients and Hessians achieve O(ε^{-7/4}) complexity by discretizing a new ODE model, with adaptive Lipschitz estimation in one variant.