Please use this identifier to cite or link to this item:
|Title:||Convergence properties of direct search methods for stochastic optimization|
|Authors:||Kim, S. |
|Citation:||Kim, S., Zhang, D. (2010). Convergence properties of direct search methods for stochastic optimization. Proceedings - Winter Simulation Conference : 1003-1011. ScholarBank@NUS Repository. https://doi.org/10.1109/WSC.2010.5679089|
|Abstract:||Simulation is widely used to evaluate the performance and optimize the design of a complex system. In the past few decades, a great deal of research has been devoted to solving simulation optimization problems, perhaps owing to their generality. However, although there are many problems of practical interests that can be cast in the framework of simulation optimization, it is often difficult to obtain an understanding of their structure, making them very challenging. Direct search methods are a class of deterministic optimization methods particularly designed for black-box optimization problems. In this paper, we present a class of direct search methods for simulation optimization problems with stochastic noise. The optimization problem is approximated using a sample average approximation scheme. We propose an adaptive sampling scheme to improve the efficiency of direct search methods and prove the consistency of the solutions. ©2010 IEEE.|
|Source Title:||Proceedings - Winter Simulation Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 17, 2018
WEB OF SCIENCETM
checked on Oct 31, 2018
checked on Oct 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.