Sums of Squares and Sparse Semidefinite Programming (Q5157588): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114847123 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2010.11311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive definite completion problem for a simple cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive definite completion problem: cycle completability / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are significantly more nonnegative polynomials than sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Optimization and Convex Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Do Sums of Squares Dream of Free Resolutions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of squares and varieties of minimal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum fill-in: inapproximability and almost tight lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Parametrization of Positive Semidefinite Matrices with Zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972816 / 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: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / 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: Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural conditions for cycle completable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3206078947 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:45, 30 July 2024

scientific article; zbMATH DE number 7411147
Language Label Description Also known as
English
Sums of Squares and Sparse Semidefinite Programming
scientific article; zbMATH DE number 7411147

    Statements

    Sums of Squares and Sparse Semidefinite Programming (English)
    0 references
    0 references
    0 references
    19 October 2021
    0 references
    semidefinite programming
    0 references
    matrix completion
    0 references
    real algebraic geometry
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references