Exploiting term sparsity in noncommutative polynomial optimization
From MaRDI portal
Publication:2231045
eigenvalue optimizationnoncommutative polynomial optimizationsemidefinite relaxationssum of Hermitian squaresterm sparsitytrace optimization
Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Semialgebraic sets and related spaces (14P10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Semidefinite programming (90C22) Polynomial optimization (90C23) Mathematical programming (90Cxx)
Recommendations
- Sparse noncommutative polynomial optimization
- Exploiting sparsity in complex polynomial optimization
- Optimization of polynomials in non-commuting variables
- SDP relaxations for non-commutative polynomial optimization
- Sparse Polynomial Optimization
- Approximating nonnegative polynomials via spectral sparsification
- Constrained polynomial optimization problems with noncommuting variables
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Constrained trace-optimization of polynomials in freely noncommuting variables
Cites work
- ``Positive noncommutative polynomials are sums of squares.
- A new sparse SOS decomposition algorithm based on term sparsity
- A positivstellensatz for non-commutative polynomials
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Certified roundoff error bounds using semidefinite programming
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Constrained polynomial optimization problems with noncommuting variables
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Extremal psd forms with few terms
- Global optimization with polynomials and the problem of moments
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
- Julia: a fresh approach to numerical computing
- JuMP: a modeling language for mathematical optimization
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Minimizing the sum of many rational functions
- Optimization of polynomials in non-commuting variables
- Positive definite completions of partial Hermitian matrices
- Positive semidefinite matrices with a given sparsity pattern
- Scalable semidefinite programming
- Sparse noncommutative polynomial optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
- The tracial moment problem and trace-optimization of polynomials
- Theory of operator algebras. III
- Treewidth computations. I: Upper bounds
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Cited in
(19)- A sublevel moment-SOS hierarchy for polynomial optimization
- Exploiting sparsity in complex polynomial optimization
- Dimension-free entanglement detection in multipartite Werner states
- Sparse noncommutative polynomial optimization
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Noncommutative Christoffel-Darboux kernels
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Exploiting term sparsity in Noncommutative Polynomial Optimization
- Semi-definite programming and quantum information
- Exploiting constant trace property in large-scale polynomial optimization
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- Matrix extreme points and free extreme points of free spectrahedra
- Free extreme points span generalized free spectrahedra given by compact coefficients
- A characterization for tightness of the sparse moment-SOS hierarchy
- Extensions of \(\mathrm{S}\)-lemma for noncommutative polynomial
- Sparse polynomial optimization with unbounded sets
- Sparse polynomial matrix optimization
- Sparse polynomial optimization with matrix constraints
Describes a project that uses
Uses Software
This page was built for publication: Exploiting term sparsity in noncommutative polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231045)
