SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q186222 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPT3 / rank | |||
Normal rank | |||
Revision as of 04:26, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SDP reformulation for robust optimization problems based on nonconvex QP duality |
scientific article |
Statements
SDP reformulation for robust optimization problems based on nonconvex QP duality (English)
0 references
19 July 2013
0 references
robust optimization
0 references
second-order cone programming
0 references
semidefinite programming
0 references
nonconvex quadratic programming
0 references
