The constant trace property in noncommutative optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- A Spectral Bundle Method for Semidefinite Programming
- A positivstellensatz for non-commutative polynomials
- ARPACK Users' Guide
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Computing sum of squares decompositions with rational coefficients
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Free convex algebraic geometry
- Global optimization with polynomials and the problem of moments
- Handbook on semidefinite, conic and polynomial optimization
- Moments, positive polynomials and their applications
- Optimization of polynomials in non-commuting variables
- Strong duality in lasserre's hierarchy for polynomial optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- The K-moment problem for compact semi-algebraic sets
- The truncated tracial moment problem
This page was built for publication: The constant trace property in noncommutative optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666550)
