Nothing
cccp: 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 <https://cvxopt.org> for more information).
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | 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) |
| Maintainer | Bernhard Pfaff <bernhard@pfaffikus.de> |
| License | GPL (>= 3) |
| Version | 0.3-1 |
| Package repository | View on R-Forge |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the cccp package in your browser
Any scripts or data that you put into this service are public.
