Efficient algorithms for large scale global optimization: Lennard-Jones clusters
From MaRDI portal
Publication:1415484
DOI10.1023/A:1025798414605zbMath1047.90050OpenAlexW2115558543MaRDI QIDQ1415484
Publication date: 4 December 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1025798414605
global optimizationLennard-Jones clustersmolecular conformationstochastic algorithmsmultistartmonotonic basin hopping
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Stochastic models in economics (91B70) Molecular physics (81V55)
Related Items (18)
Solving molecular distance geometry problems by global optimization algorithms ⋮ A nested heuristic for parameter tuning in support vector machines ⋮ Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ A population-based approach for hard global optimization problems based on dissimilarity measures ⋮ Local search based heuristics for global optimization: atomic clusters and beyond ⋮ Island models for cluster geometry optimization: how design options impact effectiveness and diversity ⋮ Iterated dynamic neighborhood search for packing equal circles on a sphere ⋮ On the global minimum of the classical potential energy for clusters bound by many-body forces ⋮ Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation ⋮ A filling function method for unconstrained global optimization ⋮ New results for molecular formation under pairwise potential minimization ⋮ The structure of atomic and molecular clusters, optimised using classical potentials ⋮ An application of a global optimization parametrization method on macromolecular structure problem ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology ⋮ Continuous cubic formulations for cluster detection problems in networks
Uses Software
This page was built for publication: Efficient algorithms for large scale global optimization: Lennard-Jones clusters
