Abstract

An algorithm for finding global optima using statistical prediction is presented. Assuming a random function model, lower confidence bounds on predicted values are used for sequential selection of evaluation points and as a convergence criterion. Comparison with published results for several test functions indicates that the procedure is very efficient in finding the global optimum of a multimodal function, and in terminating with relatively few evaluations.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Convergence (economics)Function (biology)Selection (genetic algorithm)Computer scienceMathematical optimizationGlobal optimizationMathematicsAlgorithmArtificial intelligence

Affiliated Institutions

Related Publications

Publication Info

Year
2003
Type
article
Pages
1241-1246
Citations
298
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

298
OpenAlex

Cite This

Dennis D. Cox, St. John (2003). A statistical method for global optimization. , 1241-1246. https://doi.org/10.1109/icsmc.1992.271617

Identifiers

DOI
10.1109/icsmc.1992.271617