Numerical Experiences with New Truncated Newton Methods in Large Scale Unconstrained Optimization

Computational Optimization and Applications

Volumn 7, Issue 1, 1997, Pages 71-87

  Lucidi, Stefano ^a   Roma, Massimo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Curvilinear linesearch; Lanczos method; Large scale unconstrained optimization; Negative curvature direction; Truncated Newton methods

Indexed keywords

ALGORITHMS; MATHEMATICAL TECHNIQUES; NUMERICAL ANALYSIS; NUMERICAL METHODS;

LANCZOS METHOD; TRUNCATED NEWTON METHOD;

OPTIMIZATION;

EID: 0030672155     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008619812615     Document Type: Article

References (23)

1. I. Bongartz, A. Conn, N. Gould, and P. Toint. CUTE: Constrained and unconstrained testing environment. ACM Transaction on Mathematical Software, 21:123-160, 1995.
2. A. Conn, N. Gould, and P. Toint. LANCELOT: A Fortran package for Large-Scale Nonlinear Optimization (Release A). Springer Verlag, Heidelberg, Berlin, 1992.
3. J. Cullum and R. Willoughby. Lanczos alghorithms for large symmetric eigenvalue computations. Birkhauser, Boston, 1985.
4. R. Dembo, S. Eisenstat, and T. Steihaug. Inexact Newton methods. SIAM Journal on Numerical Analysis, 19:400-408, 1982.
5. R. Dembo and T. Steihaug. Truncated-Newton methods algorithms for large-scale unconstrained optimization. Mathematical Programming, 26:190-212, 1983.
6. N. Deng, Y. Xiao, and F. Zhou. Nonmonotonic trust region algorithm. Journal of Optimization Theory and Applications, 76:259-285, 1993.
7. M. Ferris, S. Lucidi, and M. Roma. Nonmonotone curvilinear linesearch methods for unconstrained optimization. Computational Optimization and Applications, 6: 117-136, 1996.
8. G. Golub and C. Van Loan. Matrix Computations. The John Hopkins Press, Baltimore, 1989.
9. 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.
10. L. Grippo, F. Lampariello, and S. Lucidi. A class of nonmonotone stabilization methods in unconstrained optimization. Numerische Mathematik, 59:779-805, 1991.
11. G. Liu and J. Han. Convergence of the BFGS algorithm with nonmonotone linesearch. Technical report, Institute of Applied Mathematics, Academia Sinica, Beijing, 1993.
12. 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.
13. G. McCormick. A modification of Armijo's step-size rule for negative curvature. Mathematical Programming, 13:111-115, 1977.
14. J. Moré and D. Sorensen. On the use of directions of negative curvature in a modified Newton method. Mathematical Programming, 16:1-20, 1979.
15. S. Nash. Newton-type minimization via Lanczos method. SIAM Journal on Numerical Analysis, 21:770-788, 1984.
16. 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.
17. C. Paige and M. Saunders. Solution of sparse indefinite systems of linear equations. SIAM Journal on Numerical Analysis, 12:617-629, 1975.
18. B. Parlett. The symmetric eigenvalue problem. Prentice-Hall series in Computational Mathematics, Englewood Cliffs, 1980.
19. 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.
20. 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.
21. P. Toint. An assesment of non-monotone linesearch techniques for unconstrained optimization. SIAM Journal of Scientific Computing, 17: 725-739, 1996.
22. 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.
23. Y. Xiao and F. Zhou. Nonmonotone trust region methods with curvilinear path in unconstrained minimization. Computing, 48:303-317, 1992.