Sequential quadratic programming method for determining the minimum energy path.

Published

Journal Article

A new method, referred to as the sequential quadratic programming method, is presented for determining minimum energy paths. The method is based on minimizing the points representing the path in the subspace perpendicular to the tangent of the path while using a penalty term to prevent kinks from forming. Rather than taking one full step, the minimization is divided into a number of sequential steps on an approximate quadratic surface. The resulting method can efficiently determine the reaction mechanism, from which transition state can be easily identified and refined with other methods. To improve the resolution of the path close to the transition state, points are clustered close to this region with a reparametrization scheme. The usefulness of the algorithm is demonstrated for the Muller-Brown potential, amide hydrolysis, and an 89 atom cluster taken from the active site of 4-oxalocrotonate tautomerase for the reaction which catalyzes 2-oxo-4-hexenedioate to the intermediate 2-hydroxy-2,4-hexadienedioate.

Full Text

Duke Authors

Cited Authors

  • Burger, SK; Yang, W

Published Date

  • October 2007

Published In

Volume / Issue

  • 127 / 16

Start / End Page

  • 164107 -

PubMed ID

  • 17979319

Pubmed Central ID

  • 17979319

Electronic International Standard Serial Number (EISSN)

  • 1089-7690

International Standard Serial Number (ISSN)

  • 0021-9606

Digital Object Identifier (DOI)

  • 10.1063/1.2780147

Language

  • eng