Cone Constrained Convex Problems

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).


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.2-7 by Bernhard Pfaff, a year ago

Browse source code at

Authors: Bernhard Pfaff [aut, cre] , Lieven Vandenberghe [cph] (copyright holder of cvxopt) , Martin Andersen [cph] (copyright holder of cvxopt) , Joachim Dahl [cph] (copyright holder of cvxopt)

Documentation:   PDF Manual  

Task views: Optimization and Mathematical Programming

GPL (>= 3) license

Imports Rcpp

Depends on methods

Suggests RUnit, numDeriv

Linking to Rcpp, RcppArmadillo

Imported by optiSolve.

Depended on by FRAPO.

Enhanced by CVXR.

See at CRAN