ncpol2sdpa
Solve global polynomial optimization problems of either commutative variables or noncommutative operators through a semidefinite programming (SDP) relaxation
Solve global polynomial optimization problems of either commutative variables or noncommutative operators through a semidefinite programming (SDP) relaxation
| Name | Type | Version | Platform | Labels | Updated | Size | Actions |
|---|
| No records available. |