Asynchronously parallel optimization solver for finding multiple minima
DOI10.1007/s12532-017-0131-4zbMath1398.65123OpenAlexW2794440401MaRDI QIDQ1621691
Jeffrey Larson, Stefan M. Wild
Publication date: 9 November 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/1466333
global optimizationderivative-free optimizationmultistartconcurrent function evaluationsparallel optimization algorithms
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (4)
Uses Software
Cites Work
- Parallel deterministic and stochastic global minimization of functions with very many minima
- Design and implementation of a massively parallel version of DIRECT
- Lipschitzian optimization without the Lipschitz constant
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
- GLODS: global and local optimization using direct search
- A batch, derivative-free algorithm for finding multiple local minima
- A particle swarm pattern search method for bound constrained global optimization
- Asynchronous Parallel Pattern Search for Nonlinear Optimization
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Algorithm 856
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- Benchmarking Derivative-Free Optimization Algorithms
- Algorithm 829
- Global optimization
This page was built for publication: Asynchronously parallel optimization solver for finding multiple minima