Search

• Novel constrained grey-box optimization framework using Gaussian process models. • New almost everywhere differentiable acquisition function for composite functions. • Efficient moment-based approximation of chance constraints. • Tailored algorithm for enrichment sub-problem that exploits model structure. • Performance comparison with Bayesian optimization on diverse set of test problems. [Display omitted] Many engineering problems involve the optimization of computationally expensive models for which derivative information is not readily available. The Bayesian optimization (BO) framework is a particularly promising approach for solving these problems, which uses Gaussian process (GP) models and an expected utility function to systematically tradeoff between exploitation and exploration of the design space. BO, however, is fundamentally limited by the black-box model assumption that does not take into account any underlying problem structure. In this paper, we propose a new algorithm, COBALT, for constrained grey-box optimization problems that combines multivariate GP models with a novel constrained expected utility function whose structure can be exploited by state-of-the-art nonlinear programming solvers. COBALT is compared to traditional BO on seven test problems including the calibration of a genome-scale bioreactor model to experimental data. Overall, COBALT shows very promising performance on both unconstrained and constrained test problems. [ABSTRACT FROM AUTHOR]