On the complexity of finding stationary points of nonconvex quadratic programs (Q1272568)

From MaRDI portal
Revision as of 21:07, 17 July 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
On the complexity of finding stationary points of nonconvex quadratic programs
scientific article

    Statements

    On the complexity of finding stationary points of nonconvex quadratic programs (English)
    0 references
    0 references
    0 references
    0 references
    31 May 1999
    0 references
    linear complementarity problem
    0 references
    semidefinite symmetric matrix
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references