4.6 Article

ENTROPIC TRUST REGION FOR DENSEST CRYSTALLOGRAPHIC SYMMETRY GROUP PACKINGS

Journal

SIAM JOURNAL ON SCIENTIFIC COMPUTING
Volume 45, Issue 4, Pages B493-B522

Publisher

SIAM PUBLICATIONS
DOI: 10.1137/22M147983X

Keywords

crystal structure prediction; directional statistics; geometric packing; information-geometric optimization; evolutionary strategies

Ask authors/readers for more resources

Molecular crystal structure prediction is achieved by searching for the most stable periodic structure using global optimization methods within a complex energy landscape induced by intermolecular potentials. In this study, we propose a search method for the densest periodic packings restricted to crystallographic symmetry groups, and evaluate its performance on various known optimal solutions in 2-dimensional CSGs and its application in pentacene thin-film CSP.
Molecular crystal structure prediction (CSP) seeks the most stable periodic structure given the chemical composition of molecule and pressure-temperature conditions. Modern CSP solvers use global optimization methods to search for structures with minimal free energy within a complex energy landscape induced by intermolecular potentials. A major caveat of these methods is that initial configurations are random, making the search susceptible to convergence at local minima. Providing initial configurations that are densely packed with respect to the geometric representation of a molecule can significantly accelerate CSP. Motivated by these observations, we define a class of periodic packings restricted to crystallographic symmetry groups (CSG) and design a search method for the densest CSG packings in an information-geometric framework. Since CSG induces a toroidal topology on the configuration space, a non-Euclidean trust region method is performed on a statistical manifold consisting of probability distributions defined on an n-dimensional flat unit torus by extending the multivariate von Mises distribution. Introducing an adaptive quantile reformulation of the fitness function into the optimization schedule provides the algorithm with a geometric characterization through local dual geodesic flows. Moreover, we examine the geometry of the adaptive selection-quantile defined trust region and show that the algorithm performs a maximization of stochastic dependence among elements of the extended multivariate von Mises distributed random vector. We experimentally evaluate the behavior and performance of the algorithm on various densest packings of convex polygons in 2-dimensional CSGs for which optimal solutions are known, and we demonstrate its application in the pentacene thin-film CSP.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available