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).
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.3-3 |
rolling linux/jammy R-4.5 | cccp_0.3-3.tar.gz |
587.6 KiB |
0.3-3 |
rolling linux/noble R-4.5 | cccp_0.3-3.tar.gz |
601.3 KiB |
0.3-3 |
rolling source/ R- | cccp_0.3-3.tar.gz |
40.4 KiB |
0.3-3 |
latest linux/jammy R-4.5 | cccp_0.3-3.tar.gz |
587.6 KiB |
0.3-3 |
latest linux/noble R-4.5 | cccp_0.3-3.tar.gz |
601.3 KiB |
0.3-3 |
latest source/ R- | cccp_0.3-3.tar.gz |
40.4 KiB |
0.3-3 |
2026-04-26 source/ R- | cccp_0.3-3.tar.gz |
40.4 KiB |
0.3-3 |
2026-04-23 source/ R- | cccp_0.3-3.tar.gz |
40.4 KiB |
0.3-3 |
2026-04-09 windows/windows R-4.5 | cccp_0.3-3.zip |
899.7 KiB |
0.3-1 |
2025-04-20 source/ R- | cccp_0.3-1.tar.gz |
41.7 KiB |