SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:45, 30 January 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
