Solve global polynomial optimization problems of either commutative variables or noncommutative operators through a semidefinite programming (SDP) relaxation
copied from cf-staging / ncpol2sdpa| Label | Latest Version |
|---|---|
| main | 1.12.2 |
| cf201901 | 1.12.2 |
| cf202003 | 1.12.2 |
| gcc7 | 1.12.2 |
