Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557): Difference between revisions
From MaRDI portal
Created claim: DBLP publication ID (P1635): journals/jgo/ZhengSL11, #quickstatements; #temporary_batch_1731475607626 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-010-9630-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-010-9630-9 / rank | |||
Normal rank | |||
Revision as of 06:04, 9 December 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
