This is the authors' abstract. We don't add key points for this paper.
In a single-objective setting, nonconvex quadratic problems can equivalently be reformulated as convex problems over the cone of completely positive matrices. In small dimensions this cone equals the cone of matrices which are entrywise nonnegative and positive semidefinite, so the convex reformulation can be solved via SDP solvers. Considering multiobjective nonconvex quadratic problems, naturally the question arises, whether the advantage of convex reformulations extends to the multicriteria framework. In this note, we show that this approach only finds the supported nondominated points, which can already be found by using the weighted sum scalarization of the multiobjective quadratic problem, i.e. it is not suitable for multiobjective nonconvex problems.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Eichfelder et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: