COMPASS: Double-ended saddle point search as a constrained optimization problem

• Published in: The Journal of chemical physics Vol. 160; no. 6
• Main Authors: Sommer-Jörgensen, Martin, Goedecker, Stefan
• Format: Journal Article
• Language: English
• Published: United States 14.02.2024
• ISSN: 0021-9606; 1089-7690
• DOI: 10.1063/5.0186903

We present an algorithm to find first order saddle points on the potential energy surface (PES). The algorithm is formulated as a constrained optimization problem that involves two sets of atomic coordinates (images), a time-varying distance constraint and a constraint on the energy difference. Both images start in different valleys of the PES and are pulled toward each other by gradually reducing the distance. The search space is restricted to the pairs of configurations that share the same potential energy. By minimizing the energy while the distance shrinks, a minimum of the constrained search space is tracked. In simple cases, the two images are confined to their respective sides of the barrier until they finally converge near the saddle point. If one image accidentally crosses the barrier, the path is split at suitable locations and the algorithm is repeated recursively. The optimization is implemented as a combination of a quasi-Newton optimization and a linear constraint. The method was tested on a set of Lennard-Jones-38 cluster transitions and a set of 121 molecular reactions using density functional theory calculations. The efficiency in terms of energy and force evaluation is better than with competing methods as long as they do not switch to single-ended methods. The construction of a continuous search path with small steps and the ability to focus on arbitrary subsegments of the path provide an additional value in terms of robustness and flexibility.