This work proposes a new surrogate-assisted evolutionary algorithm that partially optimizes each objective/constraint, namely surrogate-assisted partial optimization (SAPO). Solutions with better values of objective/constraint are selected from the evaluated solutions as the parent solutions and a focused objective/constraint is independently optimized using surrogate models one by one.

This paper presents a fast and auto-tunable evolutionary algorithm for solving moderately restricted expensive optimization problems. The presented algorithm is a variant of adaptive differential evolution (DE) algorithms, and is called emulation-based adaptive DE or EBADE.

This paper utilizes the expected gradient of the Gaussian Process (GP) in a surrogate-assisted evolutionary algorithm. Specifically, our proposal iteratively runs a quasi-Newton method (L-BFGS-B) changing initial points on multiple GPs constructed to approximate the promising region of the objective function.