Parallel speed-up of Monte Carlo methods for global optimization

DOI10.1006/JCOM.1994.1003zbMath0798.90124OpenAlexW2024747177MaRDI QIDQ1319353

V. Pereyra

Publication date: 16 May 1994

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/256cf844ebb548b24aa2d61f53e0f257b4ce2e0c

zbMATH Keywords

simulated annealinggenetic algorithmsMonte Carlo optimizationstochastic searchexpected hitting time

Mathematics Subject Classification ID

Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Related Items (3)

Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem ⋮ A feedback algorithm for determining search parameters for Monte Carlo optimization ⋮ Geometric Convergence of Genetic Algorithms Under Tempered Random Restart

This page was built for publication: Parallel speed-up of Monte Carlo methods for global optimization