Robust Optimization for Unconstrained Simulation-Based Problems

被引:96
作者
Bertsimas, Dimitris [1 ,2 ]
Nohadani, Omid [1 ,2 ]
Teo, Kwong Meng [3 ]
机构
[1] MIT, Alfred P Sloan Sch Management, Cambridge, MA 02139 USA
[2] MIT, Ctr Operat Res, Cambridge, MA 02139 USA
[3] Natl Univ Singapore, Dept Ind & Syst Engn, Singapore 117576, Singapore
关键词
DESIGN;
D O I
10.1287/opre.1090.0715
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In engineering design, an optimized solution often turns out to be suboptimal when errors are encountered. Although the theory of robust convex optimization has taken significant strides over the past decade, all approaches fail if the underlying cost function is not explicitly given; it is even worse if the cost function is nonconvex. In this work, we present a robust optimization method that is suited for unconstrained problems with a nonconvex cost function as well as for problems based on simulations, such as large partial differential equations (PDE) solver, response surface, and Kriging metamodels. Moreover, this technique can be employed for most real-world problems because it operates directly on the response surface and does not assume any specific structure of the problem. We present this algorithm along with the application to an actual engineering problem in electromagnetic multiple scattering of aperiodically arranged dielectrics, relevant to nanophotonic design. The corresponding objective function is highly nonconvex and resides in a 100-dimensional design space. Starting from an "optimized" design, we report a robust solution with a significantly lower worst-case cost, while maintaining optimality. We further generalize this algorithm to address a nonconvex optimization problem under both implementation errors and parameter uncertainties.
引用
收藏
页码:161 / 178
页数:18
相关论文
共 39 条
[1]  
[Anonymous], 2007, Concepts and Applications of Finite Element Analysis, DOI DOI 10.1016/B978-0-08-052402-3.50011-3
[2]  
[Anonymous], 1997, Introduction to stochastic programming
[3]  
[Anonymous], 2012, The theory of max-min and its application to weapons allocation problems
[4]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[5]   Robust optimization - methodology and applications [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2002, 92 (03) :453-480
[6]   Three-dimensional perfectly matched layer for the absorption of electromagnetic waves [J].
Berenger, JP .
JOURNAL OF COMPUTATIONAL PHYSICS, 1996, 127 (02) :363-379
[7]   Tractable approximations to robust conic optimization problems [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2006, 107 (1-2) :5-36
[8]   Robust discrete optimization and network flows [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :49-71
[9]   Robust optimization in electromagnetic scattering problems [J].
Bertsimas, Dimitris ;
Nohadani, Omid ;
Teo, Kwong Meng .
JOURNAL OF APPLIED PHYSICS, 2007, 101 (07)
[10]   CHANCE-CONSTRAINED PROGRAMMING [J].
CHARNES, A ;
COOPER, WW .
MANAGEMENT SCIENCE, 1959, 6 (01) :73-79