TY - JOUR

T1 - Single string based global optimizer for geometry optimization in strongly coupled finite clusters

T2 - An adaptive mutation-driven strategy

AU - Sarkar, Kanchan

AU - Bhattacharyya, S. P.

PY - 2013/8/21

Y1 - 2013/8/21

N2 - We propose and implement a simple adaptive heuristic to optimize the geometries of clusters of point charges or ions with the ability to find the global minimum energy configurations. The approach uses random mutations of a single string encoding the geometry and accepts moves that decrease the energy. Mutation probability and mutation intensity are allowed to evolve adaptively on the basis of continuous evaluation of past explorations. The resulting algorithm has been called Completely Adaptive Random Mutation Hill Climbing method. We have implemented this method to search through the complex potential energy landscapes of parabolically confined 3D classical Coulomb clusters of hundreds or thousands of charges - usually found in high frequency discharge plasmas. The energy per particle (EN/N) and its first and second differences, structural features, distribution of the oscillation frequencies of normal modes, etc., are analyzed as functions of confinement strength and the number of charges in the system. Certain magic numbers are identified. In order to test the feasibility of the algorithm in cluster geometry optimization on more complex energy landscapes, we have applied the algorithm for optimizing the geometries of MgO clusters, described by Coulomb-Born-Mayer potential and finding global minimum of some Lennard-Jones clusters. The convergence behavior of the algorithm compares favorably with those of other existing global optimizers.

AB - We propose and implement a simple adaptive heuristic to optimize the geometries of clusters of point charges or ions with the ability to find the global minimum energy configurations. The approach uses random mutations of a single string encoding the geometry and accepts moves that decrease the energy. Mutation probability and mutation intensity are allowed to evolve adaptively on the basis of continuous evaluation of past explorations. The resulting algorithm has been called Completely Adaptive Random Mutation Hill Climbing method. We have implemented this method to search through the complex potential energy landscapes of parabolically confined 3D classical Coulomb clusters of hundreds or thousands of charges - usually found in high frequency discharge plasmas. The energy per particle (EN/N) and its first and second differences, structural features, distribution of the oscillation frequencies of normal modes, etc., are analyzed as functions of confinement strength and the number of charges in the system. Certain magic numbers are identified. In order to test the feasibility of the algorithm in cluster geometry optimization on more complex energy landscapes, we have applied the algorithm for optimizing the geometries of MgO clusters, described by Coulomb-Born-Mayer potential and finding global minimum of some Lennard-Jones clusters. The convergence behavior of the algorithm compares favorably with those of other existing global optimizers.

UR - http://www.scopus.com/inward/record.url?scp=84903369201&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84903369201&partnerID=8YFLogxK

U2 - 10.1063/1.4818162

DO - 10.1063/1.4818162

M3 - Article

AN - SCOPUS:84903369201

VL - 139

JO - Journal of Chemical Physics

JF - Journal of Chemical Physics

SN - 0021-9606

IS - 7

M1 - 074106

ER -