Abstract
In this paper we discuss the use of truncated-Newton methods, a flexible class of iterative methods, in the solution of large-scale unconstrained minimization problems. At each major iteration, the Newton equations are approximately solved by an inner iterative algorithm. The performance of the inner algorithm, and in addition the total method, can be greatly improved by the addition of preconditioning and scaling strategies. Preconditionings can be developed using either the outer nonlinear algorithm or using information computed during the inner iteration. Several preconditioning schemes are derived and tested. Numerical tests show that a carefully chosen truncated-Newton method can perform well in comparison with nonlinear conjugate-gradient-type algorithms. This is significant, since the two classes of methods have comparable storage and operation counts, and they are the only practical methods for solving many large-scale problems. In addition, with the Hessian matrix available, the truncated-Newton algorithm performs like Newton's method, usually considered the best general method for this problem.
Keywords
Hessian matrixNewton's methodConjugate gradient methodIterative methodMathematicsNewton's method in optimizationNonlinear systemLocal convergenceAlgorithmMathematical optimizationMinificationConvergence (economics)Quasi-Newton methodScalingNumerical analysisApplied mathematicsMathematical analysis
Related Publications
Conjugate-Gradient Methods for Large-Scale Nonlinear Optimization.
Abstract : In this paper we discuss several recent conjugate-gradient type methods for solving large-scale nonlinear optimization problems. We demonstrate how the performance of...
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Preface 1. Introduction. Problems to be considered Characteristics of 'real-world' problems Finite-precision arithmetic and measurement of error Exercises 2. Nonlinear Problems ...
Conjugate Gradient Methods with Inexact Searches
Conjugate gradient methods are iterative methods for finding the minimizer of a scalar function f(x) of a vector variable x which do not update an approximation to the inverse H...
A globally convergent primal-dual interior point method for constrained optimization
Abstract This paper proposes a primal-dual interior point method for solving general nonlinearly constrained optimization problems. The method is based on solving the Barrier Ka...
Variable metric methods of minimisation
Two basic approaches to the generation of conjugate directions are considered for the problem of unconstrained minimisation of quadratic functions. The first approach results in...
Publication Info
- Year
- 1985
- Type
- article
- Volume
- 6
- Issue
- 3
- Pages
- 599-616
- Citations
- 175
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
175
OpenAlex
Cite This
Stephen G. Nash
(1985).
Preconditioning of Truncated-Newton Methods.
SIAM Journal on Scientific and Statistical Computing
, 6
(3)
, 599-616.
https://doi.org/10.1137/0906042
Identifiers
- DOI
- 10.1137/0906042