Exploring chemical space with discrete, gradient, and hybrid optimization methods.

Journal Article (Journal Article)

Discrete, gradient, and hybrid optimization methods are applied to the challenge of discovering molecules with optimized properties. The cost and performance of the approaches were studied using a tight-binding model to maximize the static first electronic hyperpolarizability of molecules. Our analysis shows that discrete branch and bound methods provide robust strategies for inverse chemical design involving diverse chemical structures. Based on the linear combination of atomic potentials, a hybrid discrete-gradient optimization strategy significantly improves the performance of the gradient methods. The hybrid method performs better than dead-end elimination and competes with branch and bound and genetic algorithms. The branch and bound methods for these model Hamiltonians are more cost effective than genetic algorithms for moderate-sized molecular optimization.

Full Text

Duke Authors

Cited Authors

  • Balamurugan, D; Yang, W; Beratan, DN

Published Date

  • November 2008

Published In

Volume / Issue

  • 129 / 17

Start / End Page

  • 174105 -

PubMed ID

  • 19045331

Electronic International Standard Serial Number (EISSN)

  • 1089-7690

International Standard Serial Number (ISSN)

  • 0021-9606

Digital Object Identifier (DOI)

  • 10.1063/1.2987711


  • eng