Methods for optimizing large molecules. Part III. An improved algorithm for geometry optimization using direct inversion in the iterative subspace (GDIIS)

The geometry optimization using direct inversion in the iterative subspace (GDIIS) has been implemented in a number of computer programs and is found to be quite efficient in the quadratic vicinity of a minimum. However, far from a minimum, the original method may fail in three typical ways: (a) convergence to a nearby critical point of higher order (e.g. transition structure), (b) oscillation around an inflection point on the potential energy surface, (c) numerical instability problems in determining the GDIIS coefficients. An improved algorithm is presented that overcomes these difficulties. The modifications include: (a) a series of tests to control the construction of an acceptable GDIIS step, (b) use of a full Hessian update rather than a fixed Hessian, (c) a more stable method for calculating the DIIS coefficients. For a set of small molecules used to test geometry optimization algorithms, the controlled GDIIS method overcomes all of the problems of the original GDIIS method, and performs as well as a quasi-Newton RFO (rational function optimization) method. For larger molecules and very tight convergence, the controlled GDIIS method shows some improvement over an RFO method. With a properly chosen Hessian update method, the present algorithm can also be used in the same form to optimize higher order critical points.

[1]  D. Shanno.  Conditioning of Quasi-Newton Methods for Function Minimization , 1970 .

[2]  Peter Pulay,et al.  An efficient direct method for geometry optimization of large molecules in internal coordinates , 1998 .

[3]  Peter Pulay,et al.  The calculation of ab initio molecular geometries: efficient optimization by natural internal coordinates and empirical correction by offset forces , 1992 .

[4]  D. Goldfarb.  A family of variable-metric methods derived by variational means , 1970 .

[5]  P. Pulay.  Convergence acceleration of iterative sequences. the case of scf iteration , 1980 .

[6]  Jeffrey A. Nichols,et al.  Strategies for walking on potential energy surfaces using local quadratic approximations , 1990 .

[7]  R. Fletcher,et al.  A New Approach to Variable Metric Algorithms , 1970, Comput. J..

[8]  Peter Pulay,et al.  Geometry optimization in redundant internal coordinates , 1992 .

[9]  Peter Pulay,et al.  Systematic AB Initio Gradient Calculation of Molecular Geometries, Force Constants, and Dipole Moment Derivatives , 1979 .

[10]  H. Bernhard Schlegel,et al.  Methods for geometry optimization of large molecules. I. An O(N2) algorithm for solving systems of linear equations for the transformation of coordinates and forces , 1998 .

[11]  H. Schlegel,et al.  Optimization of equilibrium geometries and transition structures , 1982 .

[12]  James W. McIver,et al.  Structure of transition states in organic reactions. General theory and an application to the cyclobutene-butadiene isomerization using a semiempirical molecular orbital method , 1972 .

[13]  H. Bernhard Schlegel,et al.  Methods for optimizing large molecules. II. Quadratic search , 1999 .

[14]  Jon Baker,et al.  Geometry optimization in delocalized internal coordinates: An efficient quadratically scaling algorithm for large molecules , 1999 .

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

[16]  Jon Baker,et al.  Geometry optimization of large biomolecules in redundant internal coordinates , 2000 .

[17]  Jon Baker,et al.  The generation and use of delocalized internal coordinates in geometry optimization , 1996 .

[18]  Bruce A. Murtagh,et al.  Computational Experience with Quadratically Convergent Minimisation Methods , 1970, Comput. J..

[19]  Jon Baker,et al.  Techniques for geometry optimization: A comparison of cartesian and natural internal coordinates , 1993, J. Comput. Chem..

[20]  M. J. D. Powell,et al.  Recent advances in unconstrained optimization , 1971, Math. Program..

[21]  Jan Almlöf,et al.  General methods for geometry and wave function optimization , 1992 .

[22]  H. Bernhard Schlegel,et al.  Geometry Optimization on Potential Energy Surfaces , 1995 .

[23]  Walter Thiel,et al.  Linear scaling geometry optimisation and transition state search in hybrid delocalised internal coordinates , 2000 .

[24]  M. Frisch,et al.  Using redundant internal coordinates to optimize equilibrium geometries and transition states , 1996, J. Comput. Chem..

[25]  D R Yarkony,et al.  Modern electronic structure theory , 1995 .

[26]  Josep Maria Bofill,et al.  Updated Hessian matrix and the restricted step method for locating transition structures , 1994, J. Comput. Chem..

[27]  R. Ahlrichs,et al.  Geometry optimization in generalized natural internal coordinates , 1999 .

[28]  Peter Pulay,et al.  Geometry optimization by direct inversion in the iterative subspace , 1984 .

[29]  Ajit Banerjee,et al.  Search for stationary points on surfaces , 1985 .

[30]  Olivier Coulaud,et al.  An efficient method for the coordinate transformation problem of massively three-dimensional networks , 2001 .

[31]  P. Pulay.  Improved SCF convergence acceleration , 1982 .

[32]  P. Schleyer.  Encyclopedia of computational chemistry , 1998 .

[33]  C. G. Broyden.  The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .