Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations |
scientific article |
Statements
Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (English)
0 references
8 November 2011
0 references
nonconvex quadratically constrained quadratic programming
0 references
optimal D.C. decomposition
0 references
semidefinite program
0 references
piecewise linear approximation
0 references
feasible solution
0 references
