Back

G-2021-65

Hierarchically constrained blackbox optimization

, , , and

BibTeX reference

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.

, 11 pages

Research Axis

Research application

Publication

, , , and
Operations Research Letters, 50(5), 446–451, 2022 BibTeX reference