2015
DOI: 10.1016/j.cplett.2015.09.016
|View full text |Cite
|
Sign up to set email alerts
|

Exploring the MP2 energy surface of nanoalloy clusters with a genetic algorithm: Application to sodium–potassium

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 15 publications
(21 citation statements)
references
References 39 publications
0
21
0
Order By: Relevance
“…It is possible to perform the global optimization search directly at the ab initio or density functional theory (DFT), but this has the disadvantage of being very time‐consuming. One feasible alternative is to construct an analytical potential energy surface (PES) (either by establishing a theoretically based function or using a neural network approach), which is then used by the global optimization method to discover a relevant set of low‐energy structures; another tested approach for generating a promising pool of structures was also proposed in References , by coupling standard optimization algorithms with semi‐empirical Hamiltonians or the Hartree‐Fock method.…”
Section: Introductionmentioning
confidence: 99%
“…It is possible to perform the global optimization search directly at the ab initio or density functional theory (DFT), but this has the disadvantage of being very time‐consuming. One feasible alternative is to construct an analytical potential energy surface (PES) (either by establishing a theoretically based function or using a neural network approach), which is then used by the global optimization method to discover a relevant set of low‐energy structures; another tested approach for generating a promising pool of structures was also proposed in References , by coupling standard optimization algorithms with semi‐empirical Hamiltonians or the Hartree‐Fock method.…”
Section: Introductionmentioning
confidence: 99%
“…σx- indicates the standard error and N fails indicates the relative number of times the global minimum was not reached .* The unconverged runs were removed from the calculation of these averages. This removal may compromise the analysis when N fails is nonzero .** Previous work Silva et al (2015) .…”
Section: Resultsmentioning
confidence: 99%
“…Still for the LJ 26 case, the sphere-cut-splice crossover (SCCR) performed poorly, which was expected since Chen et al indeed reported that this operator is more suitable for larger clusters (Chen et al, 2013). In our previous work (Silva et al, 2015), the employed build (PREV) was mainly composed by SCCR, but also counted with the immigration operator and a different evolutionary scheme. Within the present GA approach, our PREV build presented worse performance (falseNLM^=720) than SCCR-only build (falseNLM^=371) when it comes to the average number of local minimizations needed to reach global minimum.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Other recently developed first principles based GAs are, for example, OGOLEM [124], a versatile poolbased GA implementation for clusters and flexible molecules and a GA that uses machine-learning techniques to improve its performance [129]. Though the GA-DFT approach is the most widely used method for the GO with first principle methods, there is also a GA study which uses MP2 calculations for sodium potassium nanoalloy clusters [133]. The following briefly describes the development of the GA-DFT approach within the Birmingham Cluster Genetic Algorithm and its derivatives, developed by Johnston and collaborators.…”
Section: Genetic Algorithms For Optimizing Cluster Structuresmentioning
confidence: 99%