Geometry optimization in cartesian coordinates: The end of the Z-matrix?

Geometry optimization directly in Cartesian coordinates using the EF and GDIIS algorithms with standard Hessian updating techniques is compared and contrasted with optimization in internal coordinates utilizing the well known Z-matrix formalism. Results on a test set of 20 molecules show that, with an appropriate initial Hessian, optimization in Cartesians is just as efficient as optimization in internals, thus rendering it unnecessary to construct a Z-matrix in situations where Cartesians are readily available, for example from structural databases or graphical model builders.     

A comparative analysis of various gradient methods for geometry optimization at the ab initio SCF-MO level

Various techniques, already suggested for improving the computational efficiency of the force relaxation method, have been applied here in conjunction with the variable metric algorithms suggested by Murtagh and Sargent and by Fletcher. Various tests have been performed to assess the computational efficiency of the resulting minimization procedures. In addition, procedures where the steps are defined in terms of a parabolic fitting of the forces in approximated normal coordinates have been tested. In all cases the forces are computed analytically.     

Remarks on the updated Hessian matrix methods

Optimizing a function with respect to a set of variables using the quasi‐Newton–Raphson method implies updating the Hessian matrix at each iteration. The Broyden–Fletcher–Goldfarb–Shanno update formula is used for minimization and the Murtagh–Sargent–Powell update formula for optimization of first‐order saddle points. Two new formulae are proposed to update the Hessian matrix. One of these formulae is derived using exponential weights and should be used to locate first‐order saddle points. The second formula is a modification of the TS–Broyden–Fletcher–Goldfarb–Shanno update and could used for both minimum and first‐order saddle point optimizations. These two update Hessian matrix formulae present a performance that is the same and in many cases better that the Broyden–Fletcher–Goldfarb–Shanno and Murtagh–Sargent–Powell formulae. © 2003 Wiley Periodicals, Inc. Int J Quantum Chem 94: 324–332, 2003     

Comparison of line search minimization algorithms for exploring topography of multidimensional potential energy surfaces: Mg+Arn case

The most robust numerical algorithms for unconstrained optimization that involve a line search are tested in the problem of locating stable structures and transition states of atomic microclusters. Specifically, the popular quenching technique is compared with conjugate gradient and variable metric algorithms in the Mg⁺Ar_n clusters. It is found that the variable metric method BFGS combined with an approximate line minimization routine is the most efficient, and it shows global convergence properties. This technique is applied to find a few hundred stationary points of Mg⁺Ar₁₂ and to locate isomerization paths between the two most stable icosahedral structures found for Mg⁺Ar₁₂. The latter correspond to a solvated and a nonsolvated ion, respectively. © 1997 John Wiley & Sons, Inc. J Comput Chem 18 :1011–1022, 1997     

Modified one-electron hamiltonian method in the MC SCF theory

For orbital optimization within the MC SCF theory a modification of the OEH method is proposed with the direction of descent determined according to the Fletcher–Reeves gradient method. The combined method developed on this basis ensures the convergence of the iterative process when the Hessian singularities occur. The convergence properties of the method proposed are studied by performing the ab initio water molecule calculations using two types of multiconfigurational wave functions.     

Algorithmic tools in the study of semiempirical potential surfaces

The most efficient optimization methods implemented in the semiempirical package AMPAC are presented. They concern the minimization of the energy or of the gradient norm by either pseudo-Newton or quadratic procedures, the search for transition states, and the intrinsic reaction coordinate in conjunction with variational transition-state theories. Nonlocal methods such as simulated annealing are also introduced. © 1992 John Wiley & Sons, Inc.     

How good is a Broyden–Fletcher–Goldfarb–Shanno-like update Hessian formula to locate transition structures? Specific reformulation of Broyden–Fletcher–Goldfarb–Shanno for optimizing saddle points

Based on a study of the Broyden–Fletcher–Goldfarb–Shanno (BFGS) update Hessian formula to locate minima on a hypersurface potential energy, we present an updated Hessian formula to locate and optimize saddle points of any order that in some sense preserves the initial structure of the BFGS update formula. The performance and efficiency of this new formula is compared with the previous updated Hessian formulae such as the Powell and MSP ones. We conclude that the proposed update is quite competitive but no more efficient than the normal updates normally used in any optimization of saddle points. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 349–362, 1998     

Use of symmetric rank-one Hessian update in molecular geometry optimization

The use of the symmetric rank-one Hessian update and the Broyden–Fletcher–Goldfarb–Shano (BFGS) update formula are considered in an ab initio molecular geometry optimization algorithm. It is noted that the symmetric rank-one Hessian update has an advantage when compared with the BFGS update formula and this advantage must be more evident in the optimization of molecular geometry, because the total energy surface is a near-quadratic function with a small nonlinearity close to a minimum point. The results obtained in geometry optimization of a test group of molecules support this proposal and show that the use of the symmetric rank-one Hessian update formula permits reduction of the number of energy and gradient evaluations needed to locate a minimum on the energy surface. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1877–1886, 1998     

A survey of optimization procedures for stable structures and transition states

We examine a variety of methods for obtaining the stable geometry of molecules and the transition states of simple systems and summarize some of our findings. We find the most efficient methods for optimizing structure to be those based on calculated gradients and estimated second derivative (Hessian) matrices, the later obtained either from the Broyden–Fletcher–Goldfarb–Shanno (BFGS ) quasi-Newton update method or from approximations to the coupled perturbed Hartree–Fock method. For uncovering transition states we find particularly useful a variety of the augmented Hessian theory used to uncover regions of the potential energy hypersurface with one and only one negative eigenvalue of the Hessian matrix characterizing the catchment region of the transition state. Once this region is found we minimize the norm of the gradient vector to catch the nearest extreme point of the surface. Examples of these procedures are given.     

Extremely localized molecular orbitals (ELMO): a non-orthogonal Hartree-Fock method

A new optimization method for extremely localized molecular orbitals (ELMO) is derived in a non-orthogonal formalism. The method is based on a quasi Newton-Raphson algorithm in which an approximate diagonal-blocked Hessian matrix is calculated through the Fock matrix. The Hessian matrix inverse is updated at each iteration by a variable metric updating procedure to account for the intrinsically small coupling between the orbitals. The updated orbitals are obtained with approximately n ² operations. No n ³ processes such as matrix diagonalization, matrix multiplication or orbital orthogonalization are employed. The use of localized orbitals allows for the creation of high-quality initial “guess” orbitals from optimized molecular orbitals of small systems and thus reduces the number of iterations to converge. The delocalization effects are included by a Jacobi correction (JC) which allows the accurate calculation of the total energy with a limited number of operations. This extension, referred to as ELMO(JC), is a variational method that reproduces the Hartree-Fock (HF) energy with an error of less than 2 kcal/mol for a reduced total cost compared to standard HF methods. The small number of variables, even for a very large system, and the limited number of operations potentially makes ELMO a method of choice to study large systems. Received: 30 December 1996 / Accepted: 5 June 1997     

iVI-TD-DFT: An iterative vector interaction method for exterior/interior roots of TD-DFT

The recently proposed iterative vector interaction (iVI) method for large Hermitian eigenvalue problems (Huang et al., J. Comput. Chem. 2017, 38, 2481) is extended to generalized eigenvalue problems, HC = SCE , with the metric S being either positive definite or not. Although, it works with a fixed-dimensional search subspace, iVI can converge quickly and monotonically from above to the exact exterior/interior roots. The algorithms are further specialized to nonrelativistic and relativistic time-dependent density functional theories (TD-DFT) by taking the orbital Hessian as the metric (i.e., the inverse TD-DFT eigenvalue problem) and incorporating explicitly the paired structure into the trial vectors. The efficacy of iVI-TD-DFT is demonstrated by various examples. © 2018 Wiley Periodicals, Inc.     

A computational study of the reaction of methane with methyl radical

The activation energy and optimized transition-state geometry for the abstraction of a hydrogen atom from methane by methyl radical have been calculated by the semiempirical methods MINDO /3 and MNDO . These results are compared with other semiempirical and ab initio results. The MINDO /3 method, based upon accuracy of the computed energy of activation, appears to be the computational method of greatest reliability. A method of locating the transition state on semiempirical surfaces is demonstrated.     

A theoretical study of malononitrile addition to carbonyl compounds

The nucleophilic addition of the malononitrile anion (MN⁻) to formaldehyde was studied theoretically by the AM1 semiempirical MO method. The addition is found to be endothermic with a late productlike transition state on the reaction coordinate. Additions of MN⁻ to a series of carbonyl compounds were studied in order to investigate the substituent effect on the energetics of the title addition and the nucleophilic attack reactivity. The solvent effect was stimulated by hydrogen bonding a single molecule of water to the formaldehyde oxygen and/or to the MN⁻ anion. Its influence on the energetics and the transition-state geometry was estimated. The Hammond postulate was satisfied for the studied additions. © 1997 John Wiley & Sons, Inc. Int J Quant Chem 62 : 419–426, 1997     

TheRate: Program for ab initio direct dynamics calculations of thermal and vibrational-state-selected rate constants

We introduce TheRate (THEoretical RATEs), a complete application program with a graphical user interface (GUI) for calculating rate constants from first principles. It is based on canonical variational transition-state theory (CVT) augmented by multidimensional semiclassical zero and small curvature tunneling approximations. Conventional transition-state theory (TST) with one-dimensional Wigner or Eckart tunneling corrections is also available. Potential energy information needed for the rate calculations are obtained from ab initio molecular orbital and/or density functional electronic structure theory. Vibrational-state-selected rate constants may be calculated using a diabetic model. TheRate also introduces several technical advancements, namely the focusing technique and energy interpolation procedure. The focusing technique minimizes the number of Hessian calculations required by distributing more Hessian grid points in regions that are critical to the CVT and tunneling calculations and fewer Hessian grid points elsewhere. The energy interpolation procedure allows the use of a computationally less demanding electronic structure theory such as DFT to calculate the Hessians and geometries, while the energetics can be improved by performing a small number of single-point energy calculations along the MEP at a more accurate level of theory. The CH₄+H↔CH₃+H₂ reaction is used as a model to demonstrate usage of the program, and the convergence of the rate constants with respect to the number of electronic structure calculations. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1039–1052, 1998     

Third-order methods for molecular geometry optimizations

Third-order optimization methods that require the evaluation of the gradient and initial estimates for the second and third derivatives are described. Update algorithms for the Hessian and the third-derivative tensor are outlined. The direct inversion in the iterative subspace scheme is extended to third order and is combined with the third-order update procedures. For geometry optimization, an approximate third-derivative tensor is constructed from simple empirical formulas. Examples of application to Hartree–Fock geometry optimization problems are given. © 1993 John Wiley & Sons, Inc.     

Hessian‐free low‐mode conformational search for large‐scale protein loop optimization: application to c‐jun N‐terminal kinase JNK3

A Hessian‐free low‐mode search algorithm has been developed for large‐scale conformational searching. The new method is termed LLMOD, and it utilizes the ARPACK package to compute low‐mode eigenvectors of a Hessian matrix that is only referenced implicitly, through its product with a series of vectors. The Hessian × vector product is calculated utilizing a finite difference formula based on gradients. LLMOD is the first conformational search method that can be applied to fully flexible, unconstrained protein structures for complex loop optimization problems. LLMOD has been tested on a particularly difficult model system, c‐jun N‐terminal kinase JNK3. We demonstrate that LLMOD was able to correct a P38/ERK2/HCL‐based homology model that grossly misplaced the crucial glycine‐rich loop in the ATP‐binding site. © 2000 John Wiley & Sons, Inc. J Comput Chem 22: 21–30, 2001     

Searching for saddle points of potential energy surfaces by following a reduced gradient

The old coordinate driving procedure to find transition structures in chemical systems is revisited. The well-known gradient criterion, ∇E( x )= 0 , which defines the stationary points of the potential energy surface (PES), is reduced by one equation corresponding to one search direction. In this manner, abstract curves can be defined connecting stationary points of the PES. Starting at a given minimum, one follows a well-selected coordinate to reach the saddle of interest. Usually, but not necessarily, this coordinate will be related to the reaction progress. The method, called reduced gradient following (RGF), locally has an explicit analytical definition. We present a predictor–corrector method for tracing such curves. RGF uses the gradient and the Hessian matrix or updates of the latter at every curve point. For the purpose of testing a whole surface, the six-dimensional PES of formaldehyde, H₂CO, was explored by RGF using the restricted Hartree–Fock (RHF) method and the STO-3G basis set. Forty-nine minima and saddle points of different indices were found. At least seven stationary points representing bonded structures were detected in addition to those located using another search algorithm on the same level of theory. Further examples are the localization of the saddle for the HCN⇌CNH isomerization (used for steplength tests) and for the ring closure of azidoazomethine to 1H-tetrazole. The results show that following the reduced gradient may represent a serious alternative to other methods used to locate saddle points in quantum chemistry. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1087–1100, 1998     

Semiempirical calculations of binding enthalpy for protein–ligand complexes

A systematic semiempirical quantum mechanical study of the interactions between proteins and ligands has been performed to determine the ability of this approach for the accurate estimation of the enthalpic contribution to the binding free energy of the protein–ligand systems. This approach has been applied for eight test protein–ligand complexes with experimentally known binding enthalpies. The calculations were performed using the semiempirical PM3 approach incorporated in the MOPAC 97, ZAVA originally elaborated in Algodign, and MOPAC 2002 with MOZYME facility packages. Special attention was paid to take into account structural water molecules, which were located in the protein–ligand binding site. It was shown that the results of binding enthalpy calculations fit experimental data within ～2 kcal/mol in the presented approach. © 2003 Wiley Periodicals, Inc. Int J Quantum Chem, 2004     

The location of transition states: A comparison of Cartesian,Z-matrix,and natural internal coordinates

A comparison is made between geometry optimization in Cartesian coordinates, in Z-matrix coordinates, and in natural internal coordinates for the location of transition states. In contrast to the situation with minima, where all three coordinate systems are of comparable efficiency if a reliable estimate of the Hessian matrix is available at the starting geometry, results for 25 different transition states covering a wide range of structural types demonstrate that in practice Z-matrix coordinates are generally superior. For Cartesian coordinates, the commonly used Hessian update schemes are unable to guarantee preservation of the necessary transition state eigenvalue structure, while current algorithms for generating natural internal coordinates may have difficulty handling the distorted geometries associated with transition states. The widely used Eigenvector Following (EF) algorithm is shown to be extremely efficient for optimizing transition states. © 1996 by John Wiley & Sons, Inc.     

Using operators to expand the block matrices forming the Hessian of a molecular potential

We derive compact expressions of the second‐order derivatives of bond length, bond angle, and proper and improper torsion angle potentials, in terms of operators represented in two orthonormal bases. Hereby, simple rules to generate the Hessian of an internal coordinate or a molecular potential can be formulated. The algorithms we provide can be implemented efficiently in high‐level programming languages using vectorization. Finally, the method leads to compact expressions for a second‐order expansion of an internal coordinate or a molecular potential. © 2014 Wiley Periodicals, Inc.