Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557)

From MaRDI portal
Revision as of 07:31, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jgo/ZhengSL11, #quickstatements; #temporary_batch_1731475607626)





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
    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

    Identifiers