Abstract
Recently, in [12] a very general class of truncated Newton methods has been proposed for solving large scale unconstrained optimization problems. In this work we present the results of an extensive numerical experience obtained by different algorithms which belong to the preceding class. This numerical study, besides investigating which are the best algorithmic choices of the proposed approach, clarifies some significant points which underlies every truncated Newton based algorithm.
Keywords
This work was partially supported by Agenzia Spaziale Italiana, Roma, Italy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
I. Bongartz, A. Conn, N. Gould, and P. Toint. CUTE: Constrained and unconstrained testing environment. ACM Transaction on Mathematical Software, 21:123–160, 1995.
A. Conn, N. Gould, and P. Toint. LANCELOT: A Fortran package for Large-Scale Nonlinear Optimization (Release A). Springer Verlag, Heidelberg, Berlin, 1992.
J. Cullum and R. Willoughby. Lanczos alghorithms for large symmetric eigenvalue computations. Birkhauser, Boston. 1985.
R. Dembo, S. Eisenstat, and T. Steihaug. Inexact Newton methods. SIAM Journal on Numerical Analysis. 19:400–408, 1982.
R. Dembo and T. Steihaug. Truncated-Newton methods algorithms for large-scale unconstrained optimization. Mathematical Programming, 26:190–212, 1983.
N. Deng. Y. Xiao, and F. Zhou. Nonmonotonic trust region algorithm. Journal of Optimization Theory and Applications, 76:259–285, 1993.
M. Ferris. S. Lucidi, and M. Roma. Nonmonotone curvilinear linesearch methods for unconstrained optimization. Computational Optimization and Applications, 6: 117–136, 1996.
G. Golub and C. Van Loan. Matrix Computations. The John Hopkins Press, Baltimore, 1989.
L. Grippo, F. Lampariello. and S. Lucidi. A truncated Newton method with nonmonotone linesearch for unconstrained optimization. Journal of Optimization Theory and Applications, 60:401–419, 1989.
L. Grippo, F. Lampariello, and S. Lucidi. A class of nonmonotone stabilization methods in unconstrained optimization. Numerische Mathematik, 59:779–805, 1991.
G. Liu and J. Han. Convergence of the BFGS algorithm with nonmonotone linesearch. Technical report. Institute of Applied Mathematics, Academia Sinica, Beijing, 1993.
S. Lucidi, F. Rochetich, and M. Roma. Curvilinear stabilization techniques for truncated Newton methods in large scale unconstrained optimization: the complete results. Technical Report 02.95, Dipartimento di Informatica e Sistemistica. Università di Roma “La Sapienza”, 1995.
G. McCormick. A modification of Armijo’s step-size rule for negative curvature. Mathematical Programming. 13:111–115, 1977.
J. Moré and D. Sorensen. On the use of directions of negative curvature in a modified Newton method. Mathematical Programming, 16:1–20, 1979.
S. Nash. Newton-type minimization via Lanczos method. SIAM Journal on Numerical Analysis, 21:770–788, 1984.
S. Nash and J. Nocedal. A numerical study of the limited memory BFGS method and the truncated-Newton method for large scale optimization. SIAM Journal on Optimization, 1:358–372, 1991.
C. Paige and M. Saunders. Solution of sparse indefinite systems of linear equations. SIAM Journal on Numerical Analysis, 12:617–629, 1975.
B. Parlett. The symmetric eigenvalue problem. Prentice-Hall series in Computational Mathematics, Englewood Cliffs, 1980.
T. Schlick and A. Fogelson. TNPACK-A truncated Newton package for large-scale problems. I. algorithm and usage. ACM Transaction on Mathematical Software, 18:46–70, 1992.
G. Shultz, R. Schnabel, and R. Byrd. A family of trust-region-based algorithms for unconstrained minimization. SIAM Journal on Numerical Analysis, 22:47–67, 1985.
P. Toint. An assesment of non-monotone linesearch techniques for unconstrained optimization. SIAM Journal of Scientific Computing, 17: 725–739, 1996.
P. Toint. A non-monotone trust-region algorithm for nonlinear optimization subject to convex constraints. Technical Report 94/24, Department of Mathematics, FUNDP, Namur, Belgium, 1994.
Y. Xiao and F. Zhou. Nonmonotone trust region methods with curvilinear path in unconstrained mi nimization. Computing, 48:303–317, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers, Boston
About this chapter
Cite this chapter
Lucidi, S., Roma, M. (1997). Numerical Experiences with New Truncated Newton Methods in Large Scale Unconstrained Optimization. In: Murli, A., Toraldo, G. (eds) Computational Issues in High Performance Software for Nonlinear Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-26778-4_5
Download citation
DOI: https://doi.org/10.1007/978-0-585-26778-4_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9862-2
Online ISBN: 978-0-585-26778-4
eBook Packages: Springer Book Archive