Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint |
scientific article |
Statements
Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (English)
0 references
16 April 2021
0 references
The authors show that efficient solutions in multi-objective optimization problems with SOS-convex polynomials over a linear matrix inequality can be found by using the \(\epsilon\)-constraint method or the hybrid method. Besides some numerical examples are presented to illustrate the theoretical results. The paper is clear and well written.
0 references
multi-objective optimization
0 references
semidefinite programming
0 references
SOS-convex polynomials
0 references
linear matrix inequality
0 references
0 references
0 references
0 references
0 references
0 references
0 references
