Backtracking adaptive search: distribution of number of iterations to convergence
type: Item
instance of: scholarly article
title: Backtracking adaptive search: distribution of number of iterations to convergence
zbMATH Open document ID: 1112.90105
author: David Bulger
author: W. P. Baritompa
author: David Alexander
author: Graham R. Wood
published in: Journal of Optimization Theory and Applications
publication date: 2006-12-19T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 5080712
zbMATH Keywords: adaptive search
zbMATH Keywords: convergence rates
zbMATH Keywords: global optimization
zbMATH Keywords: point processes
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
full work available at URL: s10957-006-9040-9
OpenAlex ID: W1963973553
cites work: Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
cites work: Approximation of the distribution of convergence times for stochastic global optimisation
cites work: Hesitant adaptive search for global optimisation
cites work: Hesitant adaptive search: The distribution of the number of iterations to convergence
cites work: Pure adaptive search in global optimization
cites work: Q4788636
cites work: Implementing pure adaptive search with Grover's quantum algorithm
cites work: Expected search duration for finite backtracking adaptive search
cites work: Q3957169
DOI: 10.1007/S10957-006-9040-9
description: scientific article; zbMATH DE number 5080712