Decision Space Decomposition for Multiobjective Optimization
Open Access
- 18 February 2026
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (3) , 103
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.Keywords
Funding Information
- Clemson University
This publication has 19 references indexed in Scilit:
- Decomposition and Coordination for Many-Objective Optimization2022
- On Bi-objective Convex-Quadratic Problems2019
- Multiple Criteria Decision Analysis2016
- Integer Programming2014
- A New Scalarization Technique to Approximate Pareto Fronts of Problems with Disconnected Feasible SetsJournal of Optimization Theory and Applications, 2013
- Algebra of Efficient Sets for Multiobjective Complex SystemsJournal of Optimization Theory and Applications, 2011
- Multicriteria optimization with a multiobjective golden section line searchMathematical Programming, 2010
- A Domain Decomposition/Nash Equilibrium Methodology for the Solution of Direct and Inverse Problems in Fluid Dynamics with Evolutionary Algorithms2008
- Nonlinear Multiobjective Optimization1998
- Topologies on Closed and Closed Convex Sets1993