Solve global polynomial optimization problems of either commutative variables or noncommutative operators through a semidefinite programming (SDP) relaxation
https://anaconda.org/conda-forge/ncpol2sdpa/badges/version.svg
https://anaconda.org/conda-forge/ncpol2sdpa/badges/latest_release_date.svg
https://anaconda.org/conda-forge/ncpol2sdpa/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/ncpol2sdpa/badges/platforms.svg
https://anaconda.org/conda-forge/ncpol2sdpa/badges/license.svg
https://anaconda.org/conda-forge/ncpol2sdpa/badges/downloads.svg