Adaptive search with stochastic acceptance probabilities for global optimization
type: Item
instance of: scholarly article
title: Adaptive search with stochastic acceptance probabilities for global optimization
zbMATH Open document ID: 1152.90608
author: Archis Ghate
author: Robert L. Smith
published in: Operations Research Letters
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5324074
zbMATH Keywords: simulated annealing
zbMATH Keywords: Markov chain Monte Carlo
zbMATH Keywords: noisy objective functions
MaRDI profile type: Publication
full work available at URL: j.orl.2007.10.005
OpenAlex ID: W2040409426
cites work: Approximate implementations of pure random search in the presence of noise
cites work: A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization
cites work: Convergence theorems for a class of simulated annealing algorithms on ℝd
cites work: Optimization for simulation: theory vs. practice
cites work: Cooling Schedules for Optimal Annealing
cites work: Relative Frequencies of Generalized Simulated Annealing
cites work: A class of convergent generalized hill climbing algorithms
cites work: Optimization by Simulated Annealing
cites work: Simulated Annealing for Convex Optimization
cites work: Simulated annealing algorithms for continuous global optimization: Convergence conditions
cites work: Comparison of public-domain software for black box global optimization∗
cites work: Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
cites work: Simulated annealing for constrained global optimization
cites work: New reflection generator for simulated annealing in mixed-integer/continuous global optimization
cites work: Introduction to Stochastic Search and Optimization
cites work: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
cites work: Possible generalization of Boltzmann-Gibbs statistics.
cites work: Improving hit-and-run for global optimization
DOI: 10.1016/J.ORL.2007.10.005
description: scientific article; zbMATH DE number 5324074