A hybrid inexact regularized Newton and negative curvature method
From MaRDI portal
Publication:6568927
DOI10.1007/s10589-024-00576-6MaRDI QIDQ6568927
Publication date: 8 July 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
negative curvatureglobal complexitylocal error boundlocal convergence rateregularized Newton methods
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Regularized Newton method for unconstrained convex optimization
- Error bounds in mathematical programming
- Regularized Newton methods for convex minimization problems with singular solutions
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- Generalized phase retrieval: measurement number, matrix recovery and beyond
- Cubic regularization of Newton method and its global performance
- Optimization theory and methods. Nonlinear programming
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- Combined Primal–Dual and Penalty Methods for Convex Programming
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
This page was built for publication: A hybrid inexact regularized Newton and negative curvature method
