Original paper
Multi-objective Optimization Problems with SOS-convex Polynomials over an LMI Constraint
Abstract
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...
Paper Details
Title
Multi-objective Optimization Problems with SOS-convex Polynomials over an LMI Constraint
Published Date
Aug 1, 2020
Volume
24
Issue
4
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History