Semidefinite programming in PythonPosted on 11 September 2015
Python is becoming an outstanding environment for doing semidefinite programming. Many solvers have a Python interface, and we have a few tools to help defining SDPs. It is worth taking a brief overview at the available options. Please drop me a note if you think something is missing and I update the post.
Fortunately, almost all of the tools listed here are compatible with both Python 2 and 3. Only CVXOPT is included in Anaconda, but most of the other tools (CVXPY, PICOS, Ncpol2sdpa) can be installed from PyPI. A convenient install of these modules is important in making MATLAB obsolete.
As most of the tools rely on sparse matrices for representing data and sometimes on C or C++ for implementing computationally intensive parts, Pypy will usually not work. The exceptions are PyLMI-SDP and Ncpol2sdpa. From the commercial solvers, I only tested Mosek, which works just fine. The table below summarizes the key characteristics of the tools. The last column refers to whether complex Hermitian matrices are handled natively.
|Tool||Version||Python 2||Python 3||Pypy||PyPI||Anaconda||Hermitian|
CVXOPT is a convex solver in Python that includes SDPs. It uses its own sparse matrix implementation, which is almost identical to SciPy's
lil_matrix. Computationally intensive parts are implemented in C. Unfortunately, as of version 1.1.8, CVXOPT is a bit fragile and sometimes chokes on correctly formed SDPs. Support for complex matrices is under development.
The SDP solver family SDPA has a Python interface called SDPA-P. It was last updated three years ago, and its capabilities are now mostly available in PICOS (see below). SDPA remains challenging to compile, and this applies to Python version too.
The commercial optimization products Mosek, CPLEX, and Gurobi all have a Python interface.
SMCP can solve sparse matrix cone problems in Python.
SCS solves convex cone problems via operator splitting and it has a Python interface. It might prove faster but less accurate than other solvers.
Having an SDP solver is awesome, but it is even better if we have handy tools to define SDP problems.
CVXPY uses the disciplined convex programming paradigm similar to CVX in MATLAB. On the back-end, it can use either CVXOPT or SCS for solving SDPs.
PICOS is the Python Interface for Conic Optimization Solvers, which resembles Yalmip in MATLAB. For solving SDPs, it can use CVXOPT, SDPA, Mosek, CPLEX, and Gurobi. It has support for complex and Hermitian matrices.
PyLMI-SDP provides symbolic linear matrix inequalities (LMI) and SDP tools for Python. It has some similar functionality to PICOS, but it relies on SymPy for symbolic operations, whereas PICOS does all symbolic operations itself. Not reinventing the wheel always sounds good, but unfortunately this module sees limited development.
SDP relaxations of polynomial optimization problems
Ncpol2sdpa generates semidefinite relaxations of polynomial optimization problems. If the variables are commutative, it generates the Lasserre hierarchy, similarly to Gloptipoly in MATLAB. It is also able to use the sparse structure of such problems, like SparsePOP in MATLAB. If the variables are noncommutative, it generates various incarnations of the NPA hierarchy. For instance, in Bell scenarios, it can calculate maximum violations similarly to NPAHierarchy in MATLAB, but it also encompasses a wider ranger of applications, such as calculating the ground-state energy of certain Hamiltonians. It supports complex Hermitian matrices.