Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160)

From MaRDI portal
Revision as of 18:04, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
scientific article

    Statements

    Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex quadratic program with linear complementarity constraints
    0 references
    semidefinite program
    0 references
    quadratic convex reformulation
    0 references
    quadratically constrained quadratic program
    0 references