On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming (Q3169131)

From MaRDI portal
Revision as of 14:35, 1 September 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 Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
scientific article

    Statements

    On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2011
    0 references
    semidefinite programming relaxations
    0 references
    quadratic matrix programming
    0 references
    quadratic constrained quadratic programming
    0 references
    hard combinatorial problems
    0 references
    sparsity patterns
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references