A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems |
scientific article; zbMATH DE number 7027720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems |
scientific article; zbMATH DE number 7027720 |
Statements
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (English)
0 references
22 February 2019
0 references
robust optimization
0 references
global polynomial optimization
0 references
optimization under data uncertainty
0 references
nonconvex optimization
0 references
semi-definite programming relaxations
0 references
0 references
0 references
0.8862241506576538
0 references
0.8760891556739807
0 references
0.8558425903320312
0 references
0.8401941657066345
0 references
