The constant trace property in noncommutative optimization
From MaRDI portal
Publication:6666550
DOI10.1145/3452143.3465516MaRDI QIDQ6666550
Ngoc Hoang Anh Mai, Abhishek Bhardwaj, Victor Magron
Publication date: 20 January 2025
semidefinite programmingpolynomial optimizationsums of Hermitian squaresconditional gradient-based augmented Lagrangianconstant trace propertyeigenvalue and trace optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook on semidefinite, conic and polynomial optimization
- The \(K\)-moment problem for compact semi-algebraic sets
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Computing sum of squares decompositions with rational coefficients
- Global optimization with polynomials and the problem of moments
- Optimization of Polynomials in Non-Commuting Variables
- The truncated tracial moment problem
- Chapter 8: Free Convex Algebraic Geometry
- Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
- ARPACK Users' Guide
- A Spectral Bundle Method for Semidefinite Programming
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A positivstellensatz for non-commutative polynomials
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Strong duality in lasserre's hierarchy for polynomial optimization
Related Items (1)
This page was built for publication: The constant trace property in noncommutative optimization
