Pith. sign in

REVIEW

Generating candidates in global optimization algorithms using complementary energy landscapes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.18338 v1 pith:2LQ2Z6QQ submitted 2024-02-28 physics.chem-ph cond-mat.mtrl-sci

Generating candidates in global optimization algorithms using complementary energy landscapes

classification physics.chem-ph cond-mat.mtrl-sci
keywords landscapesenergyglobaloptimizationstructurelocalatomisticcomplementary
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Global optimization of atomistic structure rely on the generation of new candidate structures in order to drive the exploration of the potential energy surface (PES) in search for the global minimum energy (GM) structure. In this work, we discuss a type of structure generation, which locally optimizes structures in complementary energy (CE) landscapes. These landscapes are formulated temporarily during the searches as machine learned potentials (MLPs) using local atomistic environments sampled from collected data. The CE landscapes are deliberately incomplete MLPs that rather than mimicking every aspect of the true PES are sought to become much smoother, having only few local minima. This means that local optimization in the CE landscapes may facilitate identification of new funnels in the true PES. We discuss how to construct the CE landscapes and we test their influence on global optimization of a reduced rutile SnO2(110)-(4x1) surface, and an olivine (Mg2SiO4)4 cluster for which we report a new global minimum energy structure.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.