Simulated annealing, random search, MultiStart or SAD?

DOI10.1016/0167-6911(87)90094-6zbMath0609.90098OpenAlexW2067893769MaRDI QIDQ1087138

Jean Walrand, Pravin P. Varaiya, Jean-Bernard Lasserre

Publication date: 1987

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(87)90094-6

zbMATH Keywords

global optimizationstochastic optimizationsimulated annealingrandom algorithmsnon- homogeneous Markov chainsrandom research

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (3)

Metaheuristics: A bibliography ⋮ Simulated annealing - to cool or not ⋮ Best-so-far vs. where-you-are: Implications for optimal finite-time annealing

Cites Work

• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Cooling Schedules for Optimal Annealing
• Unnamed Item

This page was built for publication: Simulated annealing, random search, MultiStart or SAD?