Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700)

From MaRDI portal
Revision as of 02:57, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
scientific article

    Statements

    Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (English)
    0 references
    13 July 2009
    0 references
    0 references
    0 references
    0 references