A simplex-based numerical framework for simple and efficient robust design optimization
- 582 Downloads
The Simplex Stochastic Collocation (SSC) method is an efficient algorithm for uncertainty quantification (UQ) in computational problems with random inputs. In this work, we show how its formulation based on simplex tessellation, high degree polynomial interpolation and adaptive refinements can be employed in problems involving optimization under uncertainty. The optimization approach used is the Nelder-Mead algorithm (NM), also known as Downhill Simplex Method. The resulting SSC/NM method, called Simplex2, is based on (i) a coupled stopping criterion and (ii) the use of an high-degree polynomial interpolation in the optimization space for accelerating some NM operators. Numerical results show that this method is very efficient for mono-objective optimization and minimizes the global number of deterministic evaluations to determine a robust design. This method is applied to some analytical test cases and a realistic problem of robust optimization of a multi-component airfoil.
KeywordsNelder-Mead method Simplex stochastic collocation method Robust optimization Uncertainty quantification
This work has been partially financed by the associated team AQUARIUS (Joint team from INRIA and Stanford University). We would like to thank John Axerio-Cilies (Stanford University) for his great help.
- 5.Congedo, P.M., Witteveen, J.A.S., Iaccarino, G.: Simplex-simplex approach for robust design optimization. In: Proceedings of EUROGEN2011, Eccomas Thematic Conference (2011) Google Scholar
- 8.Eldred, M.S., Webster, C.G., Constantine, P.G.: Design under uncertainty employing stochastic expansion methods. AIAA Paper 2008-6001 (2008) Google Scholar
- 11.Gao, F., Han, L.: Implementing the Nelder-Mead simplex algorithm with adaptive parameters. Comput. Optim. Appl., 1–19 (2010). doi: 10.1007/s10589-010-9329-3
- 17.Namura, N., Shimoyama, K., Jeong, S., Obayashi, S.: Kriging/RBF-hybrid response surface method for highly nonlinear functions. In: IEEE Congress on Evolutionary Computation, pp. 2534–2541 (2011) Google Scholar
- 20.Poles, S.: The simplex method. Esteco technical report 2003-005 (2003) Google Scholar
- 25.Singer, S., Singer, S.: Complexity analysis of Nelder-Mead search iterations. In: Proceedings of the First Conference on Applied Mathematics and Computation, vol. 1, pp. 185–196 (2001) Google Scholar
- 27.Taguchi, G.: Introduction to Quality Engineering (1989). American Supplier Institute Google Scholar
- 28.Torczon, V.: Multi-directional search: a direct search algorithm for parallel machines. Ph.D. thesis, Rice University, Texas (1989) Google Scholar