Quadratic programming with one negative eigenvalue is NP-hard (Q1177910)

From MaRDI portal
Revision as of 10:50, 15 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
Quadratic programming with one negative eigenvalue is NP-hard
scientific article

    Statements

    Quadratic programming with one negative eigenvalue is NP-hard (English)
    0 references
    0 references
    0 references
    26 June 1992
    0 references
    global optimization
    0 references
    concave quadratic function
    0 references
    NP-hard
    0 references

    Identifiers