SuperSCS  1.3.2
SuperSCS: Fast & Accurate conic programming

SuperSCS is a fast solver for conic problems of the form

\begin{eqnarray*} &&\mathrm{Minimize}\ c' x \\ &&Ax + s = b\\ &&s\in\mathcal{K}, \end{eqnarray*}

where $$A\in\mathbb{R}^{m\times n}$$ is a (sparse) matrix, and $$\mathcal{K}$$ is a closed, convex, proper cone.

$$\mathcal{K}$$ can be the Cartesian product of the zero cone, the positive orthant, the second-order cone, the positive semidefinite cone and many other.

SuperSCS is based on the algorithmic scheme SuperMann applied to a Douglas-Rachford splitting on the self-dual homogeneous embedding of the original problem.

SuperSCS achieves higher accuracy and faster convergence compared to SCS as you can see for example in the CVX examples page.

# Documentation

The source code of SuperSCS is available on github.

Check out the installation guide.

## Verification

Quality assurance:

## Contributing

SuperSCS is an open-source project to which you may contribute.

You only need to keep LICENSE.txt and, if you redistribute the source code, the copyright notices therein.

## Do you have a question?

Feel free to reach us on Gitter.