Global convergence technique for the Newton method with periodic Hessian evaluation
From MaRDI portal
Publication:5956434
Recommendations
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 1392848 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- Newton-type methods for unconstrained and linearly constrained optimization
- Stopping criteria for linesearch methods without derivatives
- Testing Unconstrained Optimization Software
Cited in
(5)- High-order Newton-penalty algorithms
- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method
- The Chebyshev-Shamanskii method for solving systems of nonlinear equations
- Further insight into the Shamanskii modification of Newton method
This page was built for publication: Global convergence technique for the Newton method with periodic Hessian evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956434)