Multi-objective Optimization Problems with SOS-convex Polynomials over an LMI Constraint

In this paper, we aim to find efficient solutions of a multi-objective optimization problem over a linear matrix inequality (LMI in short), in which the objective functions are SOS-convex polynomials. We do this by using two scalarization approaches, that is, the \epsilonconstraint method and the hybrid method. More precisely, we first transform the considered multi-objective optimization problem into their scalar forms by the...