Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SeDuMi / rank | |||
Normal rank | |||
Revision as of 00:09, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming |
scientific article |
Statements
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (English)
0 references
13 July 2009
0 references
