Minimization of Lennard-Jones potential using parallel particle swarm optimization algorithm

DOI10.1007/978-3-642-14834-7_13MaRDI QIDQ3058829zbMATH OpenOpenAlexFDO

Authors Kusum Deep, Madhuri Arya

Publication date 7 December 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14834-7_13

zbMATH Keywords

parallel computingLennard-Jones potentialparallel particle swarm optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1101493
• An infeasible point method for minimizing the Lennard-Jones potential
• scientific article; zbMATH DE number 2050773
• Fast global optimization of difficult Lennard-Jones clusters
• An iterative global optimization algorithm for potential energy minimization

Cited in

(1)

• Protein structure prediction using distributed parallel particle swarm optimization

This page was built for publication: Minimization of Lennard-Jones potential using parallel particle swarm optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058829)