Asynchronously parallel optimization solver for finding multiple minima
type: Item
instance of: scholarly article
title: Asynchronously parallel optimization solver for finding multiple minima
zbMATH Open document ID: 1398.65123
author: Jeffrey Larson
author: Stefan M. Wild
published in: Mathematical Programming Computation
publication date: 2018-11-09T00:00:00Z
full work available at URL: https://www.osti.gov/biblio/1466333
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 6976049
zbMATH Keywords: parallel optimization algorithms
zbMATH Keywords: multistart
zbMATH Keywords: global optimization
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: concurrent function evaluations
describes a project that uses: PSwarm
describes a project that uses: CONDOR
describes a project that uses: PETSc
describes a project that uses: HOPSPACK
describes a project that uses: APPSPACK
describes a project that uses: CMA-ES
describes a project that uses: mpi4py
describes a project that uses: Algorithm 829
describes a project that uses: NLopt
describes a project that uses: DIRECT
describes a project that uses: BOBYQA
describes a project that uses: SDPEN
describes a project that uses: DFN
describes a project that uses: Python
describes a project that uses: GitHub
MaRDI profile type: Publication
OpenAlex ID: W2794440401
cites work: Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
cites work: GLODS: global and local optimization using direct search
cites work: Parallel deterministic and stochastic global minimization of functions with very many minima
cites work: New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
cites work: Algorithm 829
cites work: Algorithm 856
cites work: Design and implementation of a massively parallel version of DIRECT
cites work: Asynchronous parallel pattern search for nonlinear optimization
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: A batch, derivative-free algorithm for finding multiple local minima
cites work: Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Stochastic global optimization methods part I: Clustering methods
cites work: Stochastic global optimization methods part II: Multi level methods
cites work: Global optimization
cites work: A particle swarm pattern search method for bound constrained global optimization
DOI: 10.1007/S12532-017-0131-4
description: scientific article; zbMATH DE number 6976049