Global convergence technique for the Newton method with periodic Hessian evaluation
DOI10.1023/A:1011934418390zbMATH Open1032.90045OpenAlexW1819217MaRDI QIDQ5956434FDOQ5956434
Authors: Francesco Lampariello, Marco Sciandrone 
Publication date: 23 March 2004
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011934418390
Recommendations
Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Cites Work
- Testing Unconstrained Optimization Software
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Newton-type methods for unconstrained and linearly constrained optimization
- Title not available (Why is that?)
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- Stopping criteria for linesearch methods without derivatives
Cited In (5)
- High-order Newton-penalty algorithms
- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- The Chebyshev-Shamanskii method for solving systems of nonlinear equations
- Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method
- Further insight into the Shamanskii modification of Newton method
Uses Software
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)
