A direct stochastic algorithm for global search
type: Item
instance of: scholarly article
title: A direct stochastic algorithm for global search
zbMATH Open document ID: 1032.65061
DOI: 10.1016/S0096-3003(02)00629-X
author: B. Raphael
author: I. F. C. Smith
published in: Applied Mathematics and Computation
publication date: 2003-11-25T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 2009069
zbMATH Keywords: Global optimisation
zbMATH Keywords: Stochastic search
zbMATH Keywords: Random search
zbMATH Keywords: comparison of methods
zbMATH Keywords: numerical examples
zbMATH Keywords: probabilistic global search lausanne
zbMATH Keywords: genetic algorithms
zbMATH Keywords: simulated annealing
zbMATH Keywords: convergence
describes a project that uses: PGSL
MaRDI profile type: Publication
cites work: Optimization by Simulated Annealing
cites work: Q4079017
cites work: A global optimization algorithm using adaptive random search
cites work: A controlled random search procedure for global optimisation
cites work: A new version of the Price's algorithm for global optimization
cites work: Improving hit-and-run for global optimization
cites work: Pure adaptive search in global optimization
cites work: Implementing pure adaptive search for global optimization using Markov chain sampling
cites work: On uniform covering, adaptive random search and raspberries
cites work: Hesitant adaptive search for global optimisation
cites work: Comparison of public-domain software for black box global optimization∗
cites work: Global optima of Lennard-Jones clusters
cites work: Combining simulated annealing with local search heuristics
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
full work available at URL: s0096-3003(02)00629-x
OpenAlex ID: W2068582700
description: scientific article; zbMATH DE number 2009069