SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630)
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: SDP reformulation for robust optimization problems based on nonconvex QP duality |
scientific article; zbMATH DE number 6189556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SDP reformulation for robust optimization problems based on nonconvex QP duality |
scientific article; zbMATH DE number 6189556 |
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
0 references
0 references
0.8877765
0 references
0.8810824
0 references
0.8807769
0 references
0.8794854
0 references
0.8777505
0 references
0.87764657
0 references
0 references
0.87603587
0 references
0.8755912
0 references
