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

From MaRDI portal
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
    0 references
    0 references
    0 references
    0 references
    linear complementarity problem
    0 references
    semidefinite symmetric matrix
    0 references