The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization

DOI10.1016/j.camwa.2003.09.030zbMath1062.90062OpenAlexW2071709288MaRDI QIDQ1767963

H. P. J. Bolton, Johannes Arnoldus Snyman, Albert A. Groenwold

Publication date: 8 March 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2003.09.030

zbMATH Keywords

Competing optimization algorithmsGlobal stopping criterionParallel optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

On sequential approximate simultaneous analysis and design in classical topology optimization

Uses Software

• SIGMA_
• L-BFGS-B
• L-BFGS
• PVM
• LBFGS-B

Cites Work

• Unnamed Item
• Unnamed Item
• Global optimization and stochastic differential equations
• A multi-start global minimization algorithm with dynamic search trajectories
• Generalized descent for global optimization
• Stochastic techniques for global optimization: A survey of recent advances
• Application of Bayesian approach to numerical methods of global and stochastic optimization
• Global optimization using dynamic search trajectories
• A stochastic method for global optimization
• Algorithm 667: Sigma—a stochastic-integration global minimization algorithm
• Stochastic global optimization methods part I: Clustering methods
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Algorithm 778: L-BFGS-B
• A Limited Memory Algorithm for Bound Constrained Optimization
• Global optimization

This page was built for publication: The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization