Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906)

From MaRDI portal
Revision as of 21:53, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/mp/ZhengSL11, #quickstatements; #temporary_batch_1731530891435)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
scientific article

    Statements

    Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2011
    0 references
    quadratically constrained quadratic optimization
    0 references
    convex relaxation
    0 references
    matrix cones
    0 references
    semidefinite optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers