On the Investigation of Stochastic Global Optimization Algorithms

Authors:
Bill Baritompa;Eligius M. Hendrix
Affiliations:
Department of Mathematics and Computing, University of Canterbury, Christchurch, New Zealand;Department of Mathematics and Computing, University of Canterbury, Christchurch, New Zealand
Venue:
Journal of Global Optimization
Year:
2005

Citing 5
Cited 2

Pure adaptive search in Monte Carlo optimization

Mathematical Programming: Series A and B
Global optimization

Global optimization
Pure adaptive search in global optimization

Mathematical Programming: Series A and B
On Uniform Covering, Adaptive Random Search and Raspberries

Journal of Global Optimization
On success rates for controlled random search

Journal of Global Optimization

A discrete dynamic convexized method for nonlinear integer programming

Journal of Computational and Applied Mathematics
Application of SEUMRE global optimization algorithm in automotive magnetorheological brake design

Structural and Multidisciplinary Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This discussion paper for the SGO 2001 Workshop considers the process of investigating stochastic global optimization algorithms. It outlines a general plan for the systematic study of their behavior. It raises questions about performance criteria, characteristics of test cases and classification of algorithms.