Robust Optimization in Discrete Design Space for Constrained Problems

AIAA Journal ◽  
2002 ◽  
Vol 40 (4) ◽  
pp. 774-780 ◽  
Author(s):  
Kwon-Hee Lee ◽  
Gyung-Jin Park
AIAA Journal ◽  
2002 ◽  
Vol 40 ◽  
pp. 774-780
Author(s):  
K.-H. Lee ◽  
G.-J. Park

2009 ◽  
Vol 628-629 ◽  
pp. 353-356 ◽  
Author(s):  
Guang Jun Liu ◽  
Tao Jiang ◽  
An Lin Wang

A robust optimization approach of an accelerometer is presented to minimize the effect of variations from micro fabrication. The sensitivity analysis technology is employed to reduce design space and to find the key parameters that have greatest influence on the accelerometer. And then, the constraint conditions and objective functions for robust optimization and the corresponding mathematical model are presented. The optimization problem is solved by the Multiple-island Genetic Algorithm and the results show that an accelerometer with better performance is obtained.


2020 ◽  
Vol 142 (12) ◽  
Author(s):  
Priya P. Pillai ◽  
Edward Burnell ◽  
Xiqing Wang ◽  
Maria C. Yang

Abstract Engineers design for an inherently uncertain world. In the early stages of design processes, they commonly account for such uncertainty either by manually choosing a specific worst-case and multiplying uncertain parameters with safety factors or by using Monte Carlo simulations to estimate the probabilistic boundaries in which their design is feasible. The safety factors of this first practice are determined by industry and organizational standards, providing a limited account of uncertainty; the second practice is time intensive, requiring the development of separate testing infrastructure. In theory, robust optimization provides an alternative, allowing set-based conceptualizations of uncertainty to be represented during model development as optimizable design parameters. How these theoretical benefits translate to design practice has not previously been studied. In this work, we analyzed the present use of geometric programs as design models in the aerospace industry to determine the current state-of-the-art, then conducted a human-subjects experiment to investigate how various mathematical representations of uncertainty affect design space exploration. We found that robust optimization led to far more efficient explorations of possible designs with only small differences in an experimental participant’s understanding of their model. Specifically, the Pareto frontier of a typical participant using robust optimization left less performance “on the table” across various levels of risk than the very best frontiers of participants using industry-standard practices.


2005 ◽  
Vol 107 (1-2) ◽  
pp. 37-61 ◽  
Author(s):  
E. Erdoğan ◽  
G. Iyengar

Author(s):  
Immanuel Bomze ◽  
Markus Gabl

Abstract In this paper we explore convex reformulation strategies for non-convex quadratically constrained optimization problems (QCQPs). First we investigate such reformulations using Pataki’s rank theorem iteratively. We show that the result can be used in conjunction with conic optimization duality in order to obtain a geometric condition for the S-procedure to be exact. Based upon known results on the S-procedure, this approach allows for some insight into the geometry of the joint numerical range of the quadratic forms. Then we investigate a reformulation strategy introduced in recent literature for bilinear optimization problems which is based on adjustable robust optimization theory. We show that, via a similar strategy, one can leverage exact reformulation results of QCQPs in order to derive lower bounds for more complicated quadratic optimization problems. Finally, we investigate the use of reformulation strategies in order to derive characterizations of set-copositive matrix cones. Empirical evidence based upon first numerical experiments shows encouraging results.


2019 ◽  
Vol 40 (10) ◽  
pp. 1002-1012 ◽  
Author(s):  
Tae Kyu Kim ◽  
Kwang‐Seok Seo ◽  
Sang‐Oh Kwon ◽  
Hee‐Sung Kim ◽  
Jun‐Hee Kim ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document