Global convergence technique for the Newton method with periodic Hessian evaluation

DOI10.1023/A:1011934418390zbMath1032.90045MaRDI QIDQ5956434

Marco Sciandrone, Francesco Lampariello

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

zbMATH Keywords

unconstrained optimization; global and superlinear convergence; Newton-type method

Mathematics Subject Classification ID

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

90C53: Methods of quasi-Newton type

Related Items

A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods, High-order Newton-penalty algorithms, 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, The Chebyshev-Shamanskii method for solving systems of nonlinear equations

Uses Software

• KELLEY
• minpack

Cites Work

• Global convergence and stabilization of unconstrained minimization methods without derivatives
• Stopping criteria for linesearch methods without derivatives
• Testing Unconstrained Optimization Software
• Newton-type methods for unconstrained and linearly constrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item