Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework (Q2706347)

From MaRDI portal
Revision as of 12:10, 15 August 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
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
scientific article

    Statements

    Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2001
    0 references
    semidefinite programming
    0 references
    primal-dual interior-point method
    0 references
    matrix completion problem
    0 references
    chordal graph
    0 references

    Identifiers