Journal of Optimization Theory and Applications Исследование операций и наука управления

Decision Space Decomposition for Multiobjective Optimization

Emma Soriano, Mishko Mitkovski, Margaret M. Wiecek
Springer Nature · 2026-02-18 · DOI 10.1007/s10957-025-02924-w

Аннотация

Abstract Being inspired by the parametric decomposition theorem for multiobjective optimization problems (MOPs) of Cuenca Mira and Miguel García (2017), and by the block-coordinate descent method for single objective optimization problems, we present a decomposition theorem for computing the set of minimal elements of a partially ordered set. This set is decomposed into subsets whose minimal elements are used to retrieve the overall minimal elements. We apply this approach to convex MOPs decomposing their decision space into lines and prove the set convergence of this method in the Painlevé-Kuratowski sense. A special case for biobjective quadratic optimization problems is included.

Читать у издателя →