Fast global optimization of difficult Lennard-Jones clusters
From MaRDI portal
Publication:5960291
DOI10.1023/A:1013596313166zbMath0988.90054MaRDI QIDQ5960291
Publication date: 15 April 2002
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Applications of mathematical programming (90C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
A nested heuristic for parameter tuning in support vector machines ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ Local search based heuristics for global optimization: atomic clusters and beyond ⋮ A mesh adaptive basin hopping method for the design of circular antenna arrays ⋮ Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization ⋮ Island models for cluster geometry optimization: how design options impact effectiveness and diversity ⋮ A particle swarm pattern search method for bound constrained global optimization ⋮ A combined global \& local search (CGLS) approach to global optimization ⋮ An iterative global optimization algorithm for potential energy minimization ⋮ Enhancing PSO methods for global optimization ⋮ An application of a global optimization parametrization method on macromolecular structure problem ⋮ Clustering methods for large scale geometrical global optimization ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ A sensible estimate for the stability constant of the Lennard-Jones potential ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container
