Efficient Implementation of the Truncated-Newton Algorithm for Large-Scale Chemistry Applications

To efficiently implement the truncated-Newton (TN) optimization method for large-scale, highly nonlinear functions in chemistry, an unconventional modified Cholesky (UMC) factorization is proposed to avoid large modifications to a problem-derived preconditioner, used in the inner loop in approximating the TN search vector at each step. The main motivation is to reduce the computational time of the overall method: large changes in standard modified Cholesky factorizations are found to increase the number of total iterations, as well as computational time, significantly. Since the UMC may generate an indefinite, rather than a positive definite, effective preconditioner, we prove that directions of descent still result. Hence, convergence to a local minimum can be shown, as in classic TN methods, for our UMC-based algorithm. Our incorporation of the UMC also requires changes in the TN inner loop regarding the negative-curvature test (which we replace by a descent direction test) and the choice of exit directions. Numerical experiments demonstrate that the unconventional use of an indefinite preconditioner works much better than the minimizer without preconditioning or other minimizers available in the molecular mechanics package CHARMM. Good performance of the resulting TN method for large potential energy problems is also shown with respect to the limited-memory BFGS method, tested both with and without preconditioning.

[1]  Elizabeth Eskow,et al.  A New Modified Cholesky Factorization , 1990, SIAM J. Sci. Comput..

[2]  S. Nash.  Newton-Type Minimization via the Lanczos Method , 1984 .

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

[4]  Jorge Nocedal,et al.  A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization , 1991, SIAM J. Optim..

[5]  T. Schlick,et al.  A transition-rate investigation by molecular dynamics with the Langevin/implicit-Euler scheme , 1991 .

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

[7]  S. H. Cheng,et al.  A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization , 1998, SIAM J. Matrix Anal. Appl..

[8]  Panos M. Pardalos,et al.  Copmputer Simulations in Molecular and Protein Conformations , 1997, Journal of Global Optimization.

[9]  David J. Thuente,et al.  Line search algorithms with guaranteed sufficient decrease , 1994, TOMS.

[10]  J. Bunch,et al.  Some stable methods for calculating inertia and solving symmetric linear systems , 1977 .

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

[12]  S. Nash.  Preconditioning of Truncated-Newton Methods , 1985 .

[13]  Tamar Schlick,et al.  Remark on Algorithm 702—the updated truncated Newton minimization package , 1999, TOMS.

[14]  Tamar Schlick,et al.  Modified Cholesky Factorizations for Sparse Preconditioners , 1993, SIAM J. Sci. Comput..

[15]  Philip E. Gill,et al.  Newton-type methods for unconstrained and linearly constrained optimization , 1974, Math. Program..

[16]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[17]  Anders Forsgren,et al.  Computing Modified Newton Directions Using a Partial Cholesky Factorization , 1995, SIAM J. Sci. Comput..

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

[19]  Tamar Schlick,et al.  TNPACK—A truncated Newton minimization package for large-scale problems: I. Algorithm and usage , 1992, TOMS.

[20]  M. Karplus,et al.  CHARMM: A program for macromolecular energy, minimization, and dynamics calculations , 1983 .

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

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

[23]  François-Xavier Le Dimet,et al.  Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods , 1993, SIAM J. Optim..

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

[25]  Tamar Schlick,et al.  A truncated Newton minimizer adapted for CHARMM and biomolecular applications , 1994, J. Comput. Chem..