A population-based approach for hard global optimization problems based on dissimilarity measures
From MaRDI portal
Publication:879969
DOI10.1007/s10107-006-0006-3zbMath1116.90084OpenAlexW1964857324MaRDI QIDQ879969
Andrea Grosso, Fabio Schoen, Marco Locatelli
Publication date: 10 May 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0006-3
Basin hoppingLarge scale global optimizationMolecular conformation problemsMultistartPopulation-based approaches
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Equilibrium statistical mechanics (82B99)
Related Items
Solving molecular distance geometry problems by global optimization algorithms, A concave optimization-based approach for sparse portfolio selection, Dissimilarity measures for population-based global optimization algorithms, A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems, Improved penalty algorithm for mixed integer PDE constrained optimization problems, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, A memetic algorithm to pack unequal circles into a square, Computational investigation of simple memetic approaches for continuous global optimization, Local search based heuristics for global optimization: atomic clusters and beyond, Island models for cluster geometry optimization: how design options impact effectiveness and diversity, (Global) optimization: historical notes and recent developments, A memetic procedure for global multi-objective optimization, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, A heuristic for the circle packing problem with a variety of containers, Machine learning for global optimization, Efficiently packing unequal disks in a circle, An experimental analysis of a population based approach for global optimization, Solving the problem of packing equal and unequal circles in a circular container, Interactive model-based search for global optimization, Global optimization based on local searches, Global optimization based on local searches, An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations
Uses Software
Cites Work
- Unnamed Item
- A function to test methods applied to global minimization of potential energy of molecules
- A trust-region algorithm for global optimization
- On the limited memory BFGS method for large scale optimization
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- On the multilevel structure of global optimization problems
- An experimental analysis of a population based approach for global optimization
- Global Optimization of Morse Clusters by Potential Energy Transformations
- Local optima smoothing for global optimization
- Global optimization on funneling landscapes
