In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated independently or sequentially. The present work proposes and compares two strategies to define a hierarchical ordering of the constraints and to interrupt the evaluation process at a trial point when it is detected that it will not improve the current best solution. Numerical experiments are performed on a closed-form test problem.
@article{arxiv.2111.13953,
title = {Hierarchically constrained blackbox optimization},
author = {Stéphane Alarie and Charles Audet and Paulin Jacquot and Sébastien Le Digabel},
journal= {arXiv preprint arXiv:2111.13953},
year = {2021}
}