Bayesian optimization is a powerful optimization tool for problems where native first-order derivatives are unavailable. Recently, constrained Bayesian optimization (CBO) has been applied to many engineering applications where constraints are essential. However, several obstacles remain with current CBO algorithms that could prevent a wider adoption. We propose CBO algorithms using merit functions, such as the penalty merit function, in acquisition functions, inspired by nonlinear optimization methods, e.g., sequential quadratic programming. Merit functions measure the potential progress of both the objective and constraint functions, thus increasing algorithmic efficiency and allowing infeasible initial samples. The acquisition functions with merit functions are relaxed to have closed forms, making its implementation readily available wherever Bayesian optimization is. We further propose a unified CBO algorithm that can be seen as extension to the popular expected constrained improvement (ECI) approach. We demonstrate the effectiveness and efficiency of the proposed algorithms through numerical experiments on synthetic problems and a practical data-driven engineering design problem in the field of plasma physics.
A sampling criterion for constrained Bayesian optimization with uncertainties
Safran Tech(赛峰科技);Ecole Centrale de Lyon(里昂中央理工学院);IFP Energies Nouvelles(法国石油与新能源研究院);CNRS(法国国家科学研究中心);Mines St-Etienne(圣艾蒂安国立高等矿业学校);Université de Lyon(里昂大学);Institut Camille Jordan(卡米尔·若尔当研究所)