cccp: Cone Constrained Convex Problems
Bernhard Pfaff · 2015
Routines for solving convex optimization problems with cone constraints by means of interior-point methods. The implemented algorithms are partially ported from CVXOPT, a Python module for convex optimization (see for more information).