SDP relaxations for non-commutative polynomial optimization
From MaRDI portal
Publication:2802540
Recommendations
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Optimization of polynomials in non-commuting variables
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Sparse noncommutative polynomial optimization
- Constrained polynomial optimization problems with noncommuting variables
Cites work
- scientific article; zbMATH DE number 3781849 (Why is no real title available?)
- scientific article; zbMATH DE number 515467 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1993745 (Why is no real title available?)
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
- A glance beyond the quantum model
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- A nichtnegativstellensatz for polynomials in noncommuting variables
- A positivstellensatz for non-commutative polynomials
- A relevant two qubit Bell inequality inequivalent to the CHSH inequality
- A strict Positivstellensatz for the Weyl algebra
- An introduction to commutative and noncommutative Gröbner bases
- Connes' embedding problem and Tsirelson's problem
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Free probability theory. Papers from a workshop on random matrices and operator algebra free products, Toronto, Canada, Mars 1995
- Global optimization with polynomials and the problem of moments
- Large-scale semidefinite programs in electronic structure calculation
- Maximal sets of mutually unbiased quantum states in dimension 6
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Non-negative hereditary polynomials in a free \(*\)-algebra
- ON MUTUALLY UNBIASED BASES
- On rings of operators. Reduction theory
- On the positivstellensatz in Weyl’s algebra
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Semidefinite programming relaxations for semialgebraic problems
- Solution of the truncated complex moment problem for flat data
- Speakable and unspeakable in quantum mechanics
- Sums of squares, moment matrices and optimization over polynomials
- Symmetries of the Bell correlation inequalities
- Testing the dimension of Hilbert spaces
- Unbounded induced representations of \(\ast \)-algebras
- Unique games with entangled provers are easy
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- ``Positive noncommutative polynomials are sums of squares.
Cited in
(19)- Exploiting term sparsity in noncommutative polynomial optimization
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Sparse noncommutative polynomial optimization
- Constrained polynomial optimization problems with noncommuting variables
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- RepLAB: a computational/numerical approach to representation theory
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- The moment-SOS hierarchy: applications and related topics
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Convexity and semidefinite programming in dimension-free matrix unknowns
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- A paradox in bosonic energy computations via semidefinite programming relaxations
- Dual bounds for the positive definite functions approach to mutually unbiased bases
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- A synchronous NPA hierarchy with applications
- The tracial moment problem and trace-optimization of polynomials
This page was built for publication: SDP relaxations for non-commutative polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802540)
