cccp

cranv0.3-3

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

License GPL (>= 3)0 versions1 maintainers2 deps1,172 weekly dl
https://CRAN.R-project.org/package=cccp
43
/ 100
Health
safe to use

[email protected] is safe to use (health: 43/100)

Health breakdown0 – 100
10/25
maintenance
6/20
popularity
25/25
security
0/15
maturity
2/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

Dependencies (2)
API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/cran/cccp

First published · 2025-09-27 17:51:43

Last updated · 2025-09-27T16:50:02+00:00

cccp — Health Score 43/100 | DepScope