Efficient implementation of the truncated-newton algorithm for large-scale chemistry applications

SIAM Journal on Optimization

Volumn 10, Issue 1, 1999, Pages 132-154

  Xie, Dexuan ^a   Schlick, Tamar ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Descent direction; Indefinite preconditioner; Modified Cholesky factorization; Molecular potential minimization; Truncated Newton method; Unconventional modified Cholesky factorization

Indexed keywords

EID: 0033269652     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497313642     Document Type: Article

References (30)

1. B. R. BROOKS, R. E. BRUCCOLERI, B. D. OLAFSON, D. J. STATES, S. SWAMINATHAN, AND M. KARPLUS, CHARMM: A program for macromolecular energy, minimization, and dynamics calculations, J. Comp. Chem., 4 (1983), pp. 187-217.
2. J. R. BUNCH AND L. KAUFMAN, Some stable methods for calculating inertia and solving symmetric linear systems, Math. Comp., 31 (1977), pp. 163-655.
3. S. H. CHENG AND N. J. HIGHAM, A modified Cholesky algorithm based on a symmetric indefinite factorization, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 1097-1110.
4. R. S. DEMBO AND T. STEIHAUG, Truncated-Newton algorithms for large-scale unconstrained optimization, Math. Programming, 26 (1983), pp. 190-212.
5. P. DERREUMAUX, G. ZHANG, B. BROOKS, AND T. SCHLICK, A truncated-Newton method adapted for CHARMM and biomolecular applications, J. Comp. Chem., 15 (1994), pp. 532-552.
6. A. FORSGREN, P. E. GILL, AND W. MURRAY, Computing modified Newton directions using a partial Cholesky factorization, SIAM J. Sci. Comput., 16 (1995), pp. 139-150.
7. P. E. GILL AND W. MURRAY, Newton-type methods for unconstrained and linearly constrained optimization, Math. Programming, 28 (1974), pp. 311-350.
8. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, London, 1983.
9. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., the John Hopkins University Press, Baltimore, MD, 1986.
10. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983; reprinted as Classics Appl. Math. 16, SIAM, Philadelphia, PA, 1996.
11. J. E. DENNIS, JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983; reprinted as Classics Appl. Math. 16, SIAM, Philadelphia, PA, 1996.
12. D. C. LIU AND J. NOCEDAL, On the limited memory BFGS method for large-scale optimization, Math. Programming, 45 (1989), pp. 503-528.
13. J. J. MORÉ AND D. J. THUENTE, Line search algorithms with guaranteed sufficient decrease, ACM Trans. Math. Software, 20 (1994), pp. 286-307.
14. S. G. NASH, Newton-type minimization via the Lanczos method, SIAM J. Numer. Anal., 21 (1984), pp. 770-788.
15. S. G. NASH, Preconditioning of truncated-Newton methods, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 599-616.
16. S. G. NASH AND J. NOCEDAL, A numerical study of the limited memory BFGS method and the truncated-Newton method for large scale optimization, SIAM J. Optim., 1 (1991), pp. 358-372.
17. A. NYBERG AND T. SCHLICK, A computational investigation of dynamic properties with the implicit-Euler scheme for molecular dynamics simulations, J. Chem. Phys., 95 (1991), pp. 4986-4996.
18. P. M. PARDALOS, D. SHALLOWAY AND G. XUE, EDS., Global Minimization of Nonconvex Energy Function: Molecular Conformation and Protein Folding, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 23, AMS, Providence, RI, 1996.
19. P. M. PARDALOS AND G. XUE, EDS., Special issue on computer simulations in molecular and protein conformations, J. Global Optim., 11 (1997).
20. S. C. EISENSTAT, A. H. SHERMAN, AND M. H. SCHULTZ, Algorithms and data structures for sparse symmetric Gaussian elimination, SIAM J. Sci. Statist. Comput., 2 (1981), pp. 225-237.
21. M. H. SCHULTZ, S. C. EISENSTAT, M. C. GURSKY, AND A. H. SHERMAN, Yale sparse matrix package, I. The symmetric codes, Internat. J. Numer. Meth. Engrg., 18 (1982), pp. 1145-1151.
22. T. SCHLICK, Optimization methods in computational chemistry, in Reviews in Computational Chemistry III, pp. 1-71, K. B. Lipkowitz and D. B. Boyd, eds., VCH Publishers, New York, 1992.
23. T. SCHLICK, Modified Cholesky factorizations for sparse preconditioners, SIAM J. Sci. Comput., 14 (1993), pp. 424-445.
24. T. SCHLICK AND A. FOGELSON, TNPACK - A truncated Newton minimization package for large-scale problems: I. Algorithm and usage, ACM Trans. Math. Software, 18 (1992), pp. 46-70.
25. T. SCHLICK AND A. FOGELSON, TNPACK - A truncated Newton minimization package for large-scale problems: II. Implementation examples, ACM Trans. Math. Software, 18 (1992), pp. 71-111.
26. T. SCHLICK AND M. L. OVERTON, A powerful truncated Newton method for potential energy functions. J. Comp. Chem., 8 (1987), pp. 1025-1039.
27. R. B. SCHNABEL AND E. ESKOW, A new modified Cholesky factorization, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 1136-1158.
28. D. XIE AND T. SCHLICK, A more lenient stopping rule for line search algorithms, Optim. Methods. Softw., submitted.
29. D. XIE AND T. SCHLICK, Remark on the updated truncated Newton minimization package, Algorithm 702, ACM Trans. Math. Software, 25 (1999), pp. 108-122.
30. X. ZOU, I. M. NAVON, M. BERGER, K. H. PHUA, T. SCHLICK, AND F. X. LE DIMET, Numerical experience with limited-memory quasi-Newton and truncated Newton methods, SIAM J. Optim., 3 (1993), pp. 582-608.