Analysis of multi-objective Kriging-based methods for constrained global optimization

被引:0
作者
Cédric Durantin
Julien Marzat
Mathieu Balesdent
机构
[1] University Grenoble Alpes,
[2] CEA,undefined
[3] LETI,undefined
[4] ONERA - The French Aerospace Lab,undefined
来源
Computational Optimization and Applications | 2016年 / 63卷
关键词
Black-box functions; Constrained global optimization ; Kriging; Multi-objective optimization;
D O I
暂无
中图分类号
学科分类号
摘要
Metamodeling, i.e., building surrogate models to expensive black-box functions, is an interesting way to reduce the computational burden for optimization purpose. Kriging is a popular metamodel based on Gaussian process theory, whose statistical properties have been exploited to build efficient global optimization algorithms. Single and multi-objective extensions have been proposed to deal with constrained optimization when the constraints are also evaluated numerically. This paper first compares these methods on a representative analytical benchmark. A new multi-objective approach is then proposed to also take into account the prediction accuracy of the constraints. A numerical evaluation is provided on the same analytical benchmark and a realistic aerospace case study.
引用
收藏
页码:903 / 926
页数:23
相关论文
共 39 条
[1]  
Krige DG(1951)A statistical approach to some basic mine valuation problems on the witwatersrand J. Chem. Metall. Min. Soc. S. Afr. 52 119-139
[2]  
Jones DR(1998)Efficient global optimization of expensive black-box functions J. Glob. Optim. 13 455-492
[3]  
Schonlau MJ(1964)A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise J. Fluids Eng. 86 97-106
[4]  
Welch WJ(2009)Kriging metamodeling in simulation: a review Eur. J. Oper. Res. 192 707-716
[5]  
Kushner HJ(2012)Constrained efficient global optimization with support vector machines Struct. Multidiscip. Optim. 46 201-221
[6]  
Kleijnen JPC(2012)Infill sampling criteria for surrogate-based optimization with constraint handling Eng. Optim. 44 1147-1166
[7]  
Basudhar A(2002)Nonlinear programming without a penalty function Math. Program. 91 239-269
[8]  
Dribusch C(2004)A pattern search filter method for nonlinear programming without derivatives SIAM J. Optim. 14 980-1010
[9]  
Lacaze S(2009)A progressive barrier for derivative-free nonlinear programming SIAM J. Optim. 20 445-472
[10]  
Missoum S(2011)Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm ACM Trans. Math. Softw. 37 44-383