On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms

DOI10.1016/S0377-0427(02)00414-4zbMath1018.65080OpenAlexW1983203103MaRDI QIDQ697541

Ping Zhong, Nai-Yang Deng

Publication date: 17 September 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(02)00414-4

zbMATH Keywords

unconstrained optimizationconvergenceNewton's methodpreconditioningconjugate gradient methodCholesky factorizationNewton-PCG-like algorithmone-dimensional optimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (2)

A nonmonotone filter trust region method for the system of nonlinear equations ⋮ A new filter algorithm for a system of nonlinear equations

Uses Software

• LANCELOT

Cites Work

• Numerical experience with the truncated Newton method for unconstrained optimization
• Theoretical efficiency of an inexact Newton method
• Choosing the Forcing Terms in an Inexact Newton Method
• Unnamed Item
• Unnamed Item

This page was built for publication: On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms