Pure adaptive search for finite global optimization
type: Item
instance of: scholarly article
title: Pure adaptive search for finite global optimization
zbMATH Open document ID: 0839.90099
DOI: 10.1007/BF01585570
author: Zelda B. Zabinsky
author: W. P. Baritompa
author: Graham R. Wood
author: Mike Steel
published in: Mathematical Programming. Series A. Series B
publication date: 1996-02-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 843648
zbMATH Keywords: global optimization
zbMATH Keywords: algorithm complexity
zbMATH Keywords: random search
zbMATH Keywords: Markov chains
zbMATH Keywords: pure adaptive search
zbMATH Keywords: stochastic algorithm
MaRDI profile type: Publication
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: Q4198056
cites work: Q4094202
cites work: Pure adaptive search in Monte Carlo optimization
cites work: Pure adaptive search in global optimization
full work available at URL: https://doi.org/10.1007/bf01585570
OpenAlex ID: W1968091701
Recommended article: Pure adaptive search in global optimization
Recommended article: Pure adaptive search in Monte Carlo optimization
Recommended article: Q4343738
Recommended article: Adaptive search with stochastic acceptance probabilities for global optimization
Recommended article: Implementing pure adaptive search for global optimization using Markov chain sampling
Recommended article: Adaptive partitioned random search to global optimization
Recommended article: Stochastic adaptive search for global optimization.
Recommended article: Discrete Backtracking Adaptive Search for Global Optimization
description: scientific article; zbMATH DE number 843648