Adaptation of the UOBYQA algorithm for noisy functions

In many real-world optimization problems, the objective function may come from a simulation evaluation so that it is (a) subject to various levels of noise, (b) not differentiable, and (c) computationally hard to evaluate. In this paper, we modify Powell's UOBYQA algorithm to handle those real-...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 38th conference on Winter simulation pp. 312 - 319
Main Authors Deng, Geng, Ferris, Michael C.
Format Conference Proceeding
LanguageEnglish
Published Winter Simulation Conference 03.12.2006
SeriesACM Conferences
Subjects
Online AccessGet full text
ISBN9781424405015
1424405017
DOI10.5555/1218112.1218173

Cover

More Information
Summary:In many real-world optimization problems, the objective function may come from a simulation evaluation so that it is (a) subject to various levels of noise, (b) not differentiable, and (c) computationally hard to evaluate. In this paper, we modify Powell's UOBYQA algorithm to handle those real-world simulation problems. Our modifications apply Bayesian techniques to guide appropriate sampling strategies to estimate the objective function. We aim to make the underlying UOBYQA algorithm proceed efficiently while simultaneously controlling the amount of computational effort.
ISBN:9781424405015
1424405017
DOI:10.5555/1218112.1218173