Parallel speed-up of Monte Carlo methods for global optimization

DOI10.1006/JCOM.1994.1003MaRDI QIDQ1319353zbMATH OpenOpenAlexFDO

Authors 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 algorithmsstochastic searchMonte Carlo optimizationexpected hitting time

Mathematics Subject Classification ID

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

Recommendations

• Design and Analysis of Parallel Monte Carlo Algorithms
• A parallel Monte Carlo search algorithm for the conformational analysis of polypeptides
• Parallel line search
• scientific article; zbMATH DE number 124508
• Concurrent stochastic methods for global optimization

Cited in

(7)

• Parallelization of a dynamic Monte Carlo algorithm: A partially rejection-free conservative approach
• Parallel algorithms for global optimization problems
• A feedback algorithm for determining search parameters for Monte Carlo optimization
• Mean-square optimization for global Monte Carlo algorithms
• Geometric convergence of genetic algorithms under tempered random restart
• Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem
• The Wang-Landau algorithm reaches the flat histogram criterion in finite time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319353)