Semidefinite programming relaxations of polynomial optimization problems of commuting variables with moment constraints, parametric and bilevel variants.
Posts tagged: Noncommutative polynomials
Optimal randomness generation from entangled quantum states: computational appendix to arXiv:1505.03837.
It is possible to detect a rank loop in the hierarchy of SDP relaxations of polynomial optimization problems, but an arbitrary-precision SDP solver is recommended.
A Python solution to generate monomials of noncommutative variables.