Limit sets in global multiobjective optimization

Inspired by the recently introduced branch-and-bound method for continuous multiobjective optimization problems from G. Eichfelder, P. Kirst, L. Meng, O. Stein, A general branch-and-bound framework for continuous global multiobjective optimization, Journal of Global Optimization, 80 (2021) 195-227, we study for a general class of branch-and-bound methods in which sense the generated terminal enclosure and the terminal provisional nondominated set approximate the nondominated set when the termination accuracy is driven to zero. Our convergence analysis of the enclosures relies on constructions from the above paper, but is self-contained and also covers the mixed-integer case. The analysis for the provisional nondominated set is based on general convergence properties of the epsilon-nondominated set, and hence it is also applicable to other algorithms which generate such points. Furthermore, we discuss post processing steps for the terminal enclosure and provide numerical illustrations for the cases of two and three objective functions.

Citation

Optimization Online, Preprint ID 2021-04-8353, 2021

Article

Download

View Limit sets in global multiobjective optimization