Global optimization based on local searches
From MaRDI portal
Publication:5925165
DOI10.1007/s10479-015-2014-2zbMath1342.90149OpenAlexW3161317555MaRDI QIDQ5925165
Publication date: 22 July 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-2014-2
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method ⋮ Stochastic optimization with adaptive restart: a framework for integrated local and global learning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential evolution methods based on local searches
- Computational investigation of simple memetic approaches for continuous global optimization
- Machine learning for global optimization
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- A trust-region algorithm for global optimization
- A population-based approach for hard global optimization problems based on dissimilarity measures
- A filled function method for finding a global minimizer of a function of several variables
- A filled function method for constrained global optimization
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- General variable neighborhood search for the continuous optimization
- Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms
- Variable neighbourhood search: Methods and applications
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Global optimization and simulated annealing
- Random and quasi-random linkage methods in global optimization
- Random linkage: A family of acceptance/rejection algorithms for global sation
- Lipschitzian optimization without the Lipschitz constant
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- New classes of globally convexized filled functions for global optimization
- Simple linkage: Analysis of a threshold-accepting global optimization method
- Local search based heuristics for global optimization: atomic clusters and beyond
- Distance geometry optimization for protein structures
- A filled function method for global optimization
- Dissimilarity measures for population-based global optimization algorithms
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A review of particle swarm optimization. I: Background and development
- Memetic particle swarm optimization
- 10.1162/15324430152733124
- Global Optimization of Morse Clusters by Potential Energy Transformations
- TRUST: A Deterministic Algorithm for Global Optimization
- The Tunneling Algorithm for the Global Minimization of Functions
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Global Continuation for Distance Geometry Problems
- Trust Region Methods
- Efficient Global Geometry Optimization of Atomic and Molecular Clusters
- Local optima smoothing for global optimization
- A new filled function method for global optimization
- Global optimization based on local searches
- Global optimization on funneling landscapes
- Filled functions for unconstrained global optimization.
This page was built for publication: Global optimization based on local searches
