A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: YALMIP / rank | |||
Normal rank |
Revision as of 06:29, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems |
scientific article |
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