pyGlobOpt: Parallel Global Optimization Software for Nanoclusters, Materials, and Beyond

23 December 2024, Version 1
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

With the ever-increasing demand for atomistic structures representative of real-life systems as well as the ad-vent of exascale computers, it has now become necessary and possible to use advanced global optimization (GO) techniques to intelligently sample the potential energy surface (PES). Given the previous studies demonstrating the relative efficiency of the artificial bee colony (ABC) swarm intelligence algorithm for chemical systems, we turn to focus on maximizing the potential of this tool. This is achieved by producing a new software; pyGlobOpt is the first ABC algorithm tool that has an asynchronously parallel implementation, in practice this means that the number of concurrent sample geometries we are able to evaluate is only lim-ited to the size of computer available to us. Furthermore, pyGlobOpt interfaces directly with the atomistic simulation environment providing a huge array of potential energetic evaluators at our disposal to drive our algorithm. In this work, we show the implementation of GO algorithm and demonstrate its utility in a num-ber of examples, including the recovery of a Buckminster fullerene from a random distribution of C atoms and cluster distribution on the surface.

Keywords

Global Optimization
pyGlobOpt
Optimization Software

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.