𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A consensus line search algorithm for molecular potential energy functions

✍ Scribed by Alexander Rurainski; Andreas Hildebrandt; Hans-Peter Lenhof


Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
147 KB
Volume
30
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Force field based energy minimization of molecular structures is a central task in computational chemistry and biology. Solving this problem usually requires efficient local minimization techniques, i.e., iterative two‐step methods that search first for a descent direction and then try to estimate the step width. The second step, the so called line search, typically uses polynomial interpolation schemes to estimate the next trial step. However, dependent on local properties of the objective function alternative schemes may be more appropriate especially if the objective function shows singularities or exponential behavior. As the choice of the best interpolation scheme cannot be made a priori, we propose a new consensus line search approach that performs several different interpolation schemes at each step and then decides which one is the most reliable at the current position. Although a naive consensus approach would lead to severe performance impacts, our method does not require additional evaluations of the energy function, imposing only negligible computational overhead. Additionally, our method can be easily adapted to the local behavior of other objective functions by incorporating suitable interpolation schemes or omitting non‐fitting schemes. The performance of our consensus line search approach has been evaluated and compared to established standard line search algorithms by minimizing the structures of a large set of molecules using different force fields. The proposed algorithm shows better performance in almost all test cases, i.e., it reduces the number of iterations and function and gradient evaluations, leading to significantly reduced run times. © 2008 Wiley Periodicals, Inc. J Comput Chem, 2009


📜 SIMILAR VOLUMES


Comparison of line search minimization a
✍ Papadakis, J.; Fanourgakis, G. S.; Farantos, S. C.; Founargiotakis, M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 366 KB

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