A new adaptive Newton method with negative curvature steps achieves near-optimal complexity for nonconvex optimization using only local Hessian Lipschitz smoothness.
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem.SIAM Journal on Optimization, 27:269–291, 2017
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Fast Newton Method Under Local Lipschitz Smoothness
A new adaptive Newton method with negative curvature steps achieves near-optimal complexity for nonconvex optimization using only local Hessian Lipschitz smoothness.