A hybrid inexact regularized Newton and negative curvature method
From MaRDI portal
Publication:6568927
Recommendations
- Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization
- Nonconvex optimization using negative curvature within a modified linesearch
- An inexact regularized Newton framework with a worst-case iteration complexity of \(\mathscr{O}(\varepsilon^{-3/2})\) for nonconvex optimization
- Using negative curvature in solving nonlinear programs
- A symmetric rank-one quasi-Newton line-search method using negative curvature directions
Cites work
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- A review on subspace methods for nonlinear optimization
- Combined Primal–Dual and Penalty Methods for Convex Programming
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- Cubic regularization of Newton method and its global performance
- Error bounds in mathematical programming
- Generalized phase retrieval: measurement number, matrix recovery and beyond
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- Optimization theory and methods. Nonlinear programming
- Regularized Newton method for unconstrained convex optimization
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence
- Regularized Newton methods for convex minimization problems with singular solutions
This page was built for publication: A hybrid inexact regularized Newton and negative curvature method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568927)
