Semidefinite programming relaxations of polynomial optimization problems of commuting variables with moment constraints, parametric and bilevel variants.

## Posts tagged: Noncommutative polynomials

## Relaxations of parametric and bilevel polynomial optimization problems

Posted on .
Tags:
Noncommutative polynomials, Python, Semidefinite programming

## Optimal randomness generation from entangled quantum states

Optimal randomness generation from entangled quantum states: computational appendix to arXiv:1505.03837.

## Detecting a rank loop in the NPA hierarchy

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.

## Generating noncommutative monomials with SymPy

A Python solution to generate monomials of noncommutative variables.

Page 1 / 1