Abstract
A global optimization algorithm is introduced which generalizes H.J. Kushner's (1964) univariate search. It aims to minimize the number of probes required for a given confidence in the results. All known probes contribute to a stochastic model of the underlying score surface, and this model is interrogated for the location most likely to exceed the current result goal. The surface is assumed to be fractal, leading to a piecewise Gaussian model, where the local regions are defined by the Delaunay triangulation of the probes. The algorithm balances the competing aims of (1) sampling in the vicinity of known peaks, and (2) exploring new regions. Preliminary tests on a standard 2-D search problem were very encouraging.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Delaunay triangulationSampling (signal processing)PiecewiseUnivariateAlgorithmFractalTriangulationMathematicsComputer scienceMathematical optimizationMultivariate statisticsStatisticsComputer vision
Affiliated Institutions
Related Publications
A computational geometric approach to feasible region division in constrained global optimization
Proposes the use of the Delaunay triangulation for feasible region division in constrained global optimization. The mathematical foundations for its use, along with the practica...
A global search method for optimizing nonlinear systems
The theory and implementation of a global search method of optimization in n dimensions, inspired by Kushner's method in one dimension, are presented. This method is meant to ad...
A statistical method for global optimization
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 sequ...
An improved elastic net method for the traveling salesman problem
An elastic net method is presented for finding traveling-salesman tours; the method improves on the convergence properties of a recent model proposed by R. Durbin and D. Willsha...
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
Publication Info
- Year
- 2003
- Type
- article
- Pages
- 577-582
- Citations
- 20
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
20
OpenAlex
Cite This
John F. Elder
(2003).
Global R/sup d/ optimization when probes are expensive: the GROPE algorithm.
, 577-582.
https://doi.org/10.1109/icsmc.1992.271711
Identifiers
- DOI
- 10.1109/icsmc.1992.271711