On the design of optimization strategies based on global response surface approximation models
On the design of optimization strategies based on global response surface approximation models
Striking the correct balance between global exploration of search spaces and local exploitation of promising basins of attraction is one of the principal concerns in the design of global optimization algorithms. This is true in the case of techniques based on global response surface approximation models as well. After constructing such a model using some initial database of designs it is far from obvious how to select further points to examine so that the appropriate mix of exploration and exploitation is achieved. In this paper we propose a selection criterion based on the expected improvement measure, which allows relatively precise control of the scope of the search. We investigate its behavior through a set of artificial test functions and two structural optimization problems. We also look at another aspect of setting up search heuristics of this type: the choice of the size of the database that the initial approximation is built upon.
expected improvement, gaussian kernels, radial basis functions
31-59
Sóbester, András
096857b0-cad6-45ae-9ae6-e66b8cc5d81b
Leary, Stephen J.
2f0f8880-bc29-4d3b-9af8-b66d759e4092
Keane, Andy J.
26d7fa33-5415-4910-89d8-fb3620413def
2005
Sóbester, András
096857b0-cad6-45ae-9ae6-e66b8cc5d81b
Leary, Stephen J.
2f0f8880-bc29-4d3b-9af8-b66d759e4092
Keane, Andy J.
26d7fa33-5415-4910-89d8-fb3620413def
Sóbester, András, Leary, Stephen J. and Keane, Andy J.
(2005)
On the design of optimization strategies based on global response surface approximation models.
Journal of Global Optimization, 33 (1), .
(doi:10.1007/s10898-004-6733-1).
Abstract
Striking the correct balance between global exploration of search spaces and local exploitation of promising basins of attraction is one of the principal concerns in the design of global optimization algorithms. This is true in the case of techniques based on global response surface approximation models as well. After constructing such a model using some initial database of designs it is far from obvious how to select further points to examine so that the appropriate mix of exploration and exploitation is achieved. In this paper we propose a selection criterion based on the expected improvement measure, which allows relatively precise control of the scope of the search. We investigate its behavior through a set of artificial test functions and two structural optimization problems. We also look at another aspect of setting up search heuristics of this type: the choice of the size of the database that the initial approximation is built upon.
Text
Sobe_05pdf3.pdf
- Accepted Manuscript
More information
Published date: 2005
Keywords:
expected improvement, gaussian kernels, radial basis functions
Identifiers
Local EPrints ID: 23440
URI: http://eprints.soton.ac.uk/id/eprint/23440
ISSN: 0925-5001
PURE UUID: d83bdb1e-c25b-4ab5-8c49-dcfafce25943
Catalogue record
Date deposited: 17 Mar 2006
Last modified: 16 Mar 2024 03:26
Export record
Altmetrics
Contributors
Author:
Stephen J. Leary
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics