Preconditioning of Truncated-Newton Methods
Author:
- Stephen G. NashSNStephen G. Nash
- 1 July 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 6 (3) , 599-616
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
This publication has 20 references indexed in Scilit:
- Newton-Type Minimization via the Lanczos MethodSIAM Journal on Numerical Analysis, 1984
- Truncated-Newton algorithms for large-scale unconstrained optimizationMathematical Programming, 1983
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- A GENERALIZED CONJUGATE GRADIENT METHOD FOR THE NUMERICAL SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS1976
- Newton-type methods for unconstrained and linearly constrained optimizationMathematical Programming, 1974
- Quasi-Newton Methods for Unconstrained OptimizationIMA Journal of Applied Mathematics, 1972
- Function Minimization Without Evaluating Derivatives--a ReviewThe Computer Journal, 1965
- On best conditioned matricesProceedings of the American Mathematical Society, 1955
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952
- An iteration method for the solution of the eigenvalue problem of linear differential and integral operatorsJournal of Research of the National Bureau of Standards, 1950