Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5969580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations |
scientific article; zbMATH DE number 5969580 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.91397786
0 references
0.91263807
0 references
0.9045061
0 references
0.9029471
0 references
0.9016311
0 references
0.89996135
0 references
0 references
0.8992362
0 references
