Exploiting term sparsity in noncommutative polynomial optimization (Q2231045): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Positive semidefinite matrices with a given sparsity pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on semidefinite, conic and polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Julia: A Fresh Approach to Numerical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of many rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tracial moment problem and trace-optimization of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Polynomials in Non-Commuting Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Polynomial Optimization Problems with Noncommuting Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on matrix factorization ranks via noncommutative polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization / 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: A positivstellensatz for non-commutative polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Positive'' noncommutative polynomials are sums of squares. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse noncommutative polynomial optimization / 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: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Roundoff Error Bounds Using Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal psd forms with few terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of operator algebras. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Sparse SOS Decomposition Algorithm Based on Term Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Semidefinite Programming / rank
 
Normal rank

Revision as of 17:08, 26 July 2024

scientific article
Language Label Description Also known as
English
Exploiting term sparsity in noncommutative polynomial optimization
scientific article

    Statements

    Exploiting term sparsity in noncommutative polynomial optimization (English)
    0 references
    0 references
    0 references
    29 September 2021
    0 references
    term sparsity
    0 references
    noncommutative polynomial optimization
    0 references
    semidefinite relaxations
    0 references
    sum of Hermitian squares
    0 references
    eigenvalue optimization
    0 references
    trace optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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