On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms
DOI10.1016/S0377-0427(02)00414-4zbMATH Open1018.65080OpenAlexW1983203103MaRDI QIDQ697541FDOQ697541
Authors: 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
Recommendations
Cholesky factorizationconvergencepreconditioningunconstrained optimizationconjugate gradient methodNewton's methodNewton-PCG-like algorithmone-dimensional optimization problem
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Cites Work
Cited In (7)
- Further improvement of the Newton-PCG algorithm with automatic differentiation
- A nonmonotone filter trust region method for the system of nonlinear equations
- A theoretical analysis on efficiency of some Newton-PCG methods
- A new filter algorithm for a system of nonlinear equations
- Title not available (Why is that?)
- An inexact Newton method derived from efficiency analysis
- PCG-inexact Newton methods for unary optimization
Uses Software
This page was built for publication: On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697541)