Numerical experience with the truncated Newton method for unconstrained optimization
- 86 Downloads
The truncated Newton algorithm was devised by Dembo and Steihaug (Ref. 1) for solving large sparse unconstrained optimization problems. When far from a minimum, an accurate solution to the Newton equations may not be justified. Dembo's method solves these equations by the conjugate direction method, but truncates the iteration when a required degree of accuracy has been obtained. We present favorable numerical results obtained with the algorithm and compare them with existing codes for large-scale optimization.
Key WordsUnconstrained optimization truncated Newton method sparsity trust region
Unable to display preview. Download preview PDF.
- 1.Dembo, R., andSteihaug, T.,Truncated Newton Algorithms for Large-Scale Optimization, Mathematical Programming, Vol. 26, pp. 190–212, 1983.Google Scholar
- 2.Hestenes, M. R., andStiefel, E.,Methods of Conjugate Gradients for Solving Linear Systems, Journal of Research of the National Bureau of Standards, Vol. 49, pp. 409–436, 1952.Google Scholar
- 3.Steihaug, T.,The Conjugate Gradient Method and Trust Regions in Large-Scale Optimization, SIAM Journal on Numerical Analysis, Vol. 20, pp. 626–637, 1983.Google Scholar
- 4.Dembo, R., Eisenstat, S. C., andSteihaug, T.,Inexact Newton Methods, SIAM Journal on Numerical Analysis, Vol. 19, pp. 400–408, 1982.Google Scholar
- 5.Dixon, L. C. W., Ducksbury, P. G., andSingh, P.,A New Three-Term Conjugate Gradient Method, Journal of Optimization Theory and Applications, Vol. 47, pp. 285–300, 1985.Google Scholar
- 6.Anonymous, N. N.,Optima Manual, Numerical Optimization Centre, Hatfield Polytechnic, 1984.Google Scholar