Numerical experience with the truncated Newton method for unconstrained optimization

DOI10.1007/BF00939410zbMath0621.90080OpenAlexW2094590343MaRDI QIDQ1090623

R. C. Price, L. C. W. Dixon

Publication date: 1988

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00939410

zbMATH Keywords

sparsitytrust regionlarge scale optimizationlarge sparse unconstrained optimizationtruncated Newton algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Interval methods for global optimization, Parallel Uzawa method for large-scale minimization of partially separable functions, On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms, An inexact Newton method derived from efficiency analysis, On the final steps of Newton and higher order methods, Theoretical efficiency of an inexact Newton method

Cites Work

• A new three-term conjugate gradient method
• Truncated-Newton algorithms for large-scale unconstrained optimization
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Inexact Newton Methods
• A new algorithm for optimization
• Methods of conjugate gradients for solving linear systems