Curvilinear stabilization techniques for truncated Newton methods in large scale unconstrained optimization

SIAM Journal on Optimization

Volumn 8, Issue 4, 1998, Pages 916-939

  Lucidi, Stefano ^a   Rochetich, Francesco ^a   Roma, Massimo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

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

Indexed keywords

EID: 0032327057     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495295250     Document Type: Article

References (29)

1. M. ARIOLI, T. CHAN, I. DUFF, N. GOULD, AND J. K. REID, Computing a Search Direction for Large-Scale Linearly-Constrained Nonlinear Optimization Calculations, Technical report TR/PA/93/34, CERFACS, 1993.
2. I. BONGARTZ, A. CONN, N. GOULD, AND P. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
3. A. CONN, N. GOULD, AND P. TOINT, LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer-Verlag, Heidelberg, Berlin, 1992.
4. J. CULLUM AND R. WILLOUGHBY, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Birkhauser, Boston, 1985.
5. R. S. DEMBO, S. C. EISENSTAT, AND T. STEIHAUG, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
6. R. DEMBO AND T. STEIHAUG, Truncated-Newton methods algorithms for large-scale unconstrained optimization, Math. Programming, 26 (1983), pp. 190-212.
7. N. DENG, Y. XIAO, AND F. ZHOU, Nonmonotonic trust region algorithm, J. Optim. Theory Appl., 76 (1993), pp. 259-285.
8. M. FERRIS, S. LUCIDI, AND M. ROMA, Nonmonotone curvilinear linesearch methods for unconstrained optimization, Comput. Optim. Appl., 6 (1996), pp. 117-136.
9. R. FLETCHER, Practical Methods of Optimization, John Wiley and Sons, New York, 1987.
10. G. GOLUB AND C. VAN LOAN, Matrix Computations, 2nd ed., The John Hopkins Press, Baltimore, 1989.
11. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal., 23 (1986), pp. 707-716.
12. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A truncated Newton method with nonmonotone linesearch for unconstrained optimization, J. Optim. Theory Appl., 60 (1989), pp. 401-419.
13. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A class of nonmonotone stabilization methods in unconstrained optimization, Numer. Math., 59 (1991), pp. 779-805.
14. 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.
15. G. MCCORMICK, A modification of Armijo's step-size rule for negative curvature, Math. Programming, 13 (1977), pp. 111-115.
16. G. MCCORMICK, Nonlinear Programming: Theory, Algorithm and Application, John Wiley and Sons, New York, 1983.
17. J. MORÉ AND D. SORENSEN, On the use of directions of negative curvature in a modified Newton method, Math. Programming, 16 (1979), pp. 1-20.
18. S. G. NASH, Newton-type minimization via the Lanczos method, SIAM J. Numer. Anal., 21 (1984), pp. 770-788.
19. S. G. NASH, Preconditioning of truncated-Newton methods, SIAM J. Sci. Stat. Comput., 6 (1985), pp. 599-616.
20. J. ORTEGA AND W. RHEINBOLDT, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
21. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
22. B. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall Series in Computational Mathematics, Prentice-Hall, Englewood Cliffs, NJ, 1980.
23. T. SCHLICK AND A. FOGELSON, TNPACK - A truncated Newton package for large-scale problems: I. Algorithm and usage, ACM Trans. Math. Software, 18 (1992), pp. 46-70.
24. G. A. SHULTZ, R. B. SCHNABEL, AND R. H. BYRD, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties, SIAM J. Numer. Anal., 22 (1985), pp. 47-67.
25. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
26. P. TOINT, Towards an efficient sparsity exploiting Newton method for minimization, in Sparse Matrices and Their Uses, I. S. Duff, ed., Academic Press, London, 1981, pp. 57-88.
27. P. L. TOINT, An assessment of nonmonotone linesearch techniques for unconstrained optimization, SIAM J. Sci. Comput., 17 (1996), pp. 725-739.
28. P. TOINT, Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints, Math. Programming, 77 (1997), pp. 69-94.
29. Y. XIAO AND F. ZHOU, Nonmonotone trust region methods with curvilinear path in unconstrained minimization, Computing, 48 (1992), pp. 303-317.