peterwittek / ncpol2sdpa

Solve global polynomial optimization problems of either commutative variables or noncommutative operators through a semidefinite programming (SDP) relaxation
50Updated 6 years ago

Related projects: