SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10589-012-9520-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-012-9520-9 / rank | |||
Normal rank | |||
Revision as of 00:19, 9 December 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
0 references
0 references
0 references
