TNPACK—A truncated Newton minimization package for large-scale problems: I. Algorithm and usage

We present a FORTRAN package of subprograms for minimizing multivariate functions without constraints by a truncated Newton algorithm. The algorithm is especially suited for problems involving a large number of variables. Truncated Newton methods allow approximate, rather than exact, solutions to the Newton equations. Truncation is accomplished in the present version by using the preconditioned Conjugate Gradient algorithm (PCG) to solve approximately the Newton equations. The preconditioner M is factored in PCG using a sparse modified Cholesky factorization based on the Yale Sparse Matrix Package. In this paper we briefly describe the method and provide details for program usage

[1]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[2]  J. J. Moré,et al.  Quasi-Newton Methods, Motivation and Theory , 1974 .

[3]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[4]  Philip E. Gill,et al.  Practical optimization , 1981 .

[5]  Stanley C. Eisenstat,et al.  Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination , 1981 .

[6]  Stanley C. Eisenstat,et al.  Yale sparse matrix package I: The symmetric codes , 1982 .

[7]  Trond Steihaug,et al.  Truncated-newtono algorithms for large-scale unconstrained optimization , 1983, Math. Program..

[8]  P. Gill,et al.  Computing Forward-Difference Intervals for Numerical Optimization , 1983 .

[9]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[10]  A. Fogelson.  A MATHEMATICAL MODEL AND NUMERICAL METHOD FOR STUDYING PLATELET ADHESION AND AGGREGATION DURING BLOOD CLOTTING , 1984 .

[11]  William G. Poole,et al.  A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices , 1985 .

[12]  Thomas C. Oppe,et al.  NSPCG (Nonsymmetric Preconditioned Conjugate Gradient) user's guide: Version 1. 0: A package for solving large sparse linear systems by various iterative methods , 1988 .

[13]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[14]  Claude Lemaréchal,et al.  Some numerical experiments with variable-storage quasi-Newton algorithms , 1989, Math. Program..

[15]  S. Nash,et al.  Assessing a search direction within a truncated-newton method , 1990 .

[16]  Peter Deuflhard,et al.  Global inexact Newton methods for very large scale nonlinear problems , 1991, IMPACT Comput. Sci. Eng..

[17]  Stephen G. Nash,et al.  A General-Purpose Parallel Algorithm for Unconstrained Optimization , 1991, SIAM J. Optim..

[18]  Tamar Schlick,et al.  New Approaches to Potential Energy Minimization and Molecular Dynamics Algorithms , 1991, Comput. Chem..

[19]  Tamar Schlick,et al.  TNPACK—a truncated Newton minimization package for large-scale problems: II. Implementation examples , 1992, TOMS.