A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961)

From MaRDI portal
Revision as of 08:19, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A reformulation-convexification approach for solving nonconvex quadratic programming problems
scientific article

    Statements

    A reformulation-convexification approach for solving nonconvex quadratic programming problems (English)
    0 references
    0 references
    0 references
    8 February 1996
    0 references
    reformulation-linearization/convexification technique
    0 references
    outer-approximations
    0 references
    tight linear programming relaxations
    0 references
    linearly constrained nonconvex quadratic programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers