Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Decision Space Decomposition for Multiobjective Optimization

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年2月18日

查看全文
  • Emma Soriano,
  • Mishko Mitkovski,
  • Margaret M. Wiecek

摘要

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.