Please use this identifier to cite or link to this item:
|Title:||A trust-region algorithm for bi-objective stochastic optimization|
|Authors:||Kim, S. |
Sample average approximation
|Citation:||Kim, S., Ryu, J.-H. (2011). A trust-region algorithm for bi-objective stochastic optimization. Procedia Computer Science 4 : 1422-1430. ScholarBank@NUS Repository. https://doi.org/10.1016/j.procs.2011.04.153|
|Abstract:||We develop a new method for approximating the Pareto front of a bi-objective stochastic optimization problem in which the expected objective functions are estimated by taking sample averaged outputs from expensive simulations. At each iteration of the proposed algorithm, a trust region is identified and quadratic approximate functions for the expected objective functions are built using the sample average values. To determine non-dominated solutions in the trust region, a single-objective optimization problem is constructed based on the approximate objective functions. After updating the set of non-dominated solutions, a new trust region around the most isolated point is determined to explore areas that have not been visited. When the computational budget is limited, a large sample size at each iteration leads to more accurate approximation of the expected objective functions, but the algorithm is not able to run for enough iterations to generate a set of solutions that are close to the Pareto front. The proposed variable sampling scheme adaptively updates the sample size with consideration for this trade-off between approximation and optimization errors. The numerical results show that our proposed method is feasible, and the performance can be significantly improved with an appropriate sampling scheme. © 2011 Published by Elsevier Ltd.|
|Source Title:||Procedia Computer Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 20, 2018
WEB OF SCIENCETM
checked on Oct 3, 2018
checked on Oct 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.