Abstract
This chapter exclusively addresses the algorithms employed to perform
geometry optimization of clusters. These algorithms can be broadly classified into two
groups: gradients-based algorithms and gradient-free algorithms. Gradient-based
algorithms use the gradient of potential energy functions to give local minima. On the
contrary, gradient-free algorithms are inspired by natural processes, which exploit
some mathematical models, which lead to global minimum. Although there are a
variety of gradient-free algorithms, some of the most popular ones include genetic
algorithm, particle swarm, simulated annealing, etc. The strengths and weaknesses of
all these algorithms have been also discussed.
Related Journals
Current Chinese Chemistry
Current Analytical Chemistry
Current Computer-Aided Drug Design
Current Chinese Science
Current Topics in Chemistry
Current Science, Engineering and Technology
The Natural Products Journal
Anti-Cancer Agents in Medicinal Chemistry
Combinatorial Chemistry & High Throughput Screening
Current Bioactive Compounds
Related Books
A Journey Through Water: A Scientific Exploration of The Most Anomalous Liquid on Earth
Advances in Mathematical Chemistry and Applications
Advances in Mathematical Chemistry and Applications
Advances in Mathematical Chemistry and Applications Volume 1 (Revised Edition)
Advances in Organic Synthesis
Advances in Organic Synthesis
Advances in Organic Synthesis
Advances in Organic Synthesis
Advances in Organic Synthesis
Advances in Organic Synthesis