Path to this page:
./
wip/py-ncpol2sdpa,
Converter from noncommutative variables to sparse SDPA
Branch: CURRENT,
Version: 1.2.4,
Package name: py312-ncpol2sdpa-1.2.4,
Maintainer: jihbed.researchNcpol2sdpa is a set of scripts to convert a polynomial optimization problem
of either commutative or noncommutative variables to a sparse semidefinite
programming (SDP) problem that can be processed by the SDPA family of solvers
The optimization problem can be unconstrained or constrained by equalities
and inequalities.
Required to run:[
math/py-sympy] [
math/py-scipy] [
lang/python37]
Required to build:[
pkgtools/cwrappers]
Master sites:
RMD160: b34c3043b7cb448df2576ba4a3fecc13085e0dc6
Filesize: 26.397 KB
Version history: (Expand)
- (2024-09-19) Updated to version: py312-ncpol2sdpa-1.2.4
- (2024-09-19) Package has been reborn
- (2024-09-15) Package deleted from pkgsrc
- (2023-02-13) Updated to version: py310-ncpol2sdpa-1.2.4
- (2023-02-13) Package has been reborn
- (2021-10-08) Updated to version: py39-ncpol2sdpa-1.2.4
CVS history: (Expand)
2014-10-18 21:40:50 by Kamel Ibn Aziz Derouiche | Files touched by this commit (4) |
Log message:
Import py27-ncpol2sdpa-1.2.4 as wip/py-ncpol2sdpa.
Ncpol2sdpa is a set of scripts to convert a polynomial optimization problem
of either commutative or noncommutative variables to a sparse semidefinite
programming (SDP) problem that can be processed by the SDPA family of solvers
The optimization problem can be unconstrained or constrained by equalities
and inequalities.
|