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 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.
Article
Loading...