A population-based approach for hard global optimization problems based on dissimilarity measures
DOI10.1007/S10107-006-0006-3zbMATH Open1116.90084OpenAlexW1964857324MaRDI QIDQ879969FDOQ879969
Authors: 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
Recommendations
- Dissimilarity measures for population-based global optimization algorithms
- An experimental analysis of a population based approach for global optimization
- On the convergence of a population-based global optimization algorithm
- Population set-based global optimization algorithms: some modifications and numerical studies
- Efficient large scale global optimization through clustering-based population methods
- A unified framework for population-based metaheuristics
- Population based optimization via differential evolution and adaptive fractional gradient descent
Basin hoppingLarge scale global optimizationMolecular conformation problemsMultistartPopulation-based approaches
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Equilibrium statistical mechanics (82B99)
Cites Work
- On the limited memory BFGS method for large scale optimization
- Title not available (Why is that?)
- Local optima smoothing for global optimization
- A trust-region algorithm for global optimization
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- On the multilevel structure of global optimization problems
- Global optimization on funneling landscapes
- A function to test methods applied to global minimization of potential energy of molecules
- Global optimization of Morse clusters by potential energy transformations
- An experimental analysis of a population based approach for global optimization
Cited In (23)
- A performance analysis of Basin Hopping compared to established metaheuristics for global optimization
- An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations
- Dissimilarity measures for population-based global optimization algorithms
- Interactive model-based search for global optimization
- A concave optimization-based approach for sparse portfolio selection
- Machine learning for global optimization
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A memetic algorithm to pack unequal circles into a square
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Improved penalty algorithm for mixed integer PDE constrained optimization problems
- An experimental analysis of a population based approach for global optimization
- Island models for cluster geometry optimization: how design options impact effectiveness and diversity
- A heuristic for the circle packing problem with a variety of containers
- Efficiently packing unequal disks in a circle
- Computational investigation of simple memetic approaches for continuous global optimization
- Solving the problem of packing equal and unequal circles in a circular container
- Solving molecular distance geometry problems by global optimization algorithms
- Global optimization based on local searches
- Global optimization based on local searches
- A memetic procedure for global multi-objective optimization
- Total variation based community detection using a nonlinear optimization approach
- (Global) optimization: historical notes and recent developments
- Local search based heuristics for global optimization: atomic clusters and beyond
Uses Software
This page was built for publication: A population-based approach for hard global optimization problems based on dissimilarity measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879969)
