Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481436 | European Journal of Operational Research | 2009 | 13 Pages |
Abstract
The class of generalized pattern search (GPS) algorithms for mixed variable optimization is extended to problems with stochastic objective functions. Because random noise in the objective function makes it more difficult to compare trial points and ascertain which points are truly better than others, replications are needed to generate sufficient statistical power to draw conclusions. Rather than comparing pairs of points, the approach taken here augments pattern search with a ranking and selection (R&S) procedure, which allows for comparing many function values simultaneously. Asymptotic convergence for the algorithm is established, numerical issues are discussed, and performance of the algorithm is studied on a set of test problems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Todd A. Sriver, James W. Chrissis, Mark A. Abramson,