Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7344088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data |
scientific article; zbMATH DE number 7344088 |
Statements
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (English)
0 references
5 May 2021
0 references
multiobjective optimization
0 references
robust optimization
0 references
semidefinite programming relaxations
0 references
SOS-convex polynomials
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8815929293632507
0 references
0.8370839953422546
0 references
0.8271716237068176
0 references
0.816405713558197
0 references
