Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643)

From MaRDI portal
Revision as of 18:42, 21 March 2024 by Openalex240321050300 (talk | contribs) (Set OpenAlex properties.)
(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. II: Implementation and numerical results
scientific article

    Statements

    Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 October 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    primal-dual interior-point method
    0 references
    matrix completion problem
    0 references
    clique tree
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references