Preprocessing sparse semidefinite programs via matrix completion (Q3377970): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: METIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153101027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry groups, semidefinite programs, and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4703906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPLIB 1.2, a library of semidefinite programming test problems / rank
 
Normal rank

Latest revision as of 11:41, 24 June 2024

scientific article
Language Label Description Also known as
English
Preprocessing sparse semidefinite programs via matrix completion
scientific article

    Statements

    Preprocessing sparse semidefinite programs via matrix completion (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2006
    0 references
    semidefinite programing
    0 references
    preprocessing
    0 references
    sparsity
    0 references
    matrix completion
    0 references
    clique tree
    0 references
    numerical experiments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers