TNPACK—A truncated Newton Minimization Package for Large-Scale Problems: I. Algorithm and Usage

ACM Transactions on Mathematical Software (TOMS)

Volumn 18, Issue 1, 1992, Pages 46-70

  Schlick, Tamar ^a   Fogelson, Aaron ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF UTAH   (United States)

Author keywords

nonlinear optimization; preconditioned conjugate gradient; sparse matrices; truncated Newton methods

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; FORTRAN (PROGRAMMING LANGUAGE); LINEAR ALGEBRA; NONLINEAR PROGRAMMING; OPTIMIZATION;

PRECONDITIONED CONJUGATE GRADIENT; SOFTWARE PACKAGE TNPACK; SOFTWARE PACKAGE YALE SPARSE MATRIX; SPARSE MATRICES; TRUNCATED NEWTON METHODS;

NUMERICAL ANALYSIS;

EID: 0026824139     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/128745.150973     Document Type: Article

References (27)

1. CONCUS, P., GOLUB, G. H., AND O'OEARY, D. P. A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations. In Sparse Matrix Computation, J. R. Bunch and D. J. Rose, Eds., Academic Press, New York, 1976.
2. DEMBO, R. S., AND STEIHAUG, T. Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26, (1983), 190-212.
3. DENNIS, JR., J. E., AND MORÉ, J. J. Quasi-Newton methods, motivation and theory. SIAM Rev. 19 (1977), 46-89.
4. DENNIS, JR., J. E., AND SCHNABEL, R. B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs, NJ, (1983), 116-129.
5. DEUFLHARD, P. Global inexact Newton methods for very large scale nonlinear problems. In Proceedings of the Copper Mountain Conference on Iterative Methods (Copper Mountain, Colorado, Apr. 1-5, 1990).
6. EISENSTAT, S. C., GURSKY, M. C., SCHULTZ, M. H., AND SHERMAN, A. H. Yale sparse matrix package, I. The symmetric codes. Int. J. Numer. Meth. Eng. 18 (1982), 1145-1151.
7. EISENSTAT, S. C., SHULTZ, M. H., AND SHERMAN, A. H. Efficient implementation of sparse symmetric gaussian elimination. In Advances in Computer Methods for Partial Differential Equations, R. Vichnevetsky, Ed., AICA, New Brunswick, NJ, 1975, pp. 33-39.
8. EISENSTAT, S. C., SHULTZ, M. H., AND SHERMAN, A. H. Application of sparse matrix methods to partial differential equations. In Advances in Computer Methods for Partial Differential Equations, R. Vichnevetsky, Ed., AICA, New Brunswick, NJ, 1975, pp. 40-45.
9. EISENSTAT, S. C., SCHULTZ, M. H., AND SHERMAN, A. H. Algorithms and data structures for sparse symmetric gaussian elimination SIAM J. Sci Stat. Comput. 2 (1981), 225-237.
10. ERISMAN, A., AND GRIMES, R. Sparse matrices today. SIAM NEWS 22 (May 1989).
11. FOGELSON, A. L. A mathematical model and numerical method for studying platelet adhesion and aggregation during blood clotting. J. Comput. Phys. 56 (1984), 111-134.
12. GEORGE, A., AND LIU, J W. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ, 1981.
13. GILBERT, J. C., AND LEMARÉCHAL, C. Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45 (1989), 407-435.
14. GILL, P. E., MURRAY, W., SAUNDERS, M. A, AND WRIGHT, M. H. Computing forward-difference intervals for numerical optimization SIAM J. Sci. Stat. Comput. 4, (1983), 310-321
15. GILL, P E., MURRAY, W., AND WRIGHT, M. H. Practical Optimization. Academic Press, New York, 1983
16. GOLUB, G. H., AND VAN LOAN, C. F. Matrix Computations. Johns Hopkins Univ. Press, Baltimore, MD, 1984, 362-379.
17. LIU, D. C., AND NOCEDAL, J. On the limited memory BFGS method for large scale optimization. Math. Program. 45 (1989), 503-528.
18. MORÉ, J., AND THUENTE, D J. On line search algorithms with guaranteed sufficient decrease. Mathematics and Computer Science Division Preprint MCS-P153-0590, Argonne National Laboratory, Argonne, Ill, 1990.
19. NASH, S. G. Solving nonlinear programming problems using truncated-Newton techniques In Numerical Optimization 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds., SIAM, Philadelphia, 1985, pp. 119-136.
20. NASH, S. G., AND SOPER, A. Assessing a search direction within a truncated Newton method. Oper. Res. Lett. 9 (1990), 219-221.
21. NASH, S G., AND SOFER, A A general-purpose parallel algorithm for unconstrained optimization. SIAM J. Opt. 1 (1991), 530-547.
22. O???, T. C., JOUBERT, W. D., AND KINCAID, D. R. NSPCG User'r Guide. Version 1.0: A package for solving large sparse linear systems by various iterative methods. Tech Rep CNA-216, Center for Numerical Analysis, The Univ. of Texas at Austin, 1988.
23. ROSE, D. J. A graph-theoretic study of the numerical solution of sparse positive-definite systems of linear equations. In Graph Theory and Computing, R. C. Read, Ed., Academic Press, NY, 1972.
24. SCHLICK, T. New approaches to potential energy minimization and molecular dynamics algorithms Comput. Chem 15 (1991), 251-260.
25. SCHLICK, T., AND FOGELSON, A. TNPACK-A truncated Newton minimization package for large-scale problems: II. Implementation examples. ACM Trans. Math. Softw. 18, 1 (March 1992), 71-111.
26. SCHLICK, T., HINGERTY, B. E., PESKIN, C. S., OVERTON, M. L., AND BROYDE, S. Search strategies, minimization algorithms, and molecular dynamics simulations for exploring conformational spaces of nucleic acids. In Theoretical Biochemistry and Molecular Biophysics, Volume I: Nucleic Acids, D. L. Beveridge and R. Lavery, Eds., Adenine Press, Guilderland, New York, 1991, pp. 39-58.
27. SCHLICK, T., AND OVERTON, M. A powerful truncated Newton method for potential energy minimization. J. Comput. Chem. 8 (1987), 1025-1039.