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).
- Version0.3-1
- R version≥ 3.0.1 methods
- LicenseGPL (≥ 3)
- Needs compilation?Yes
- Last release12/09/2023
Documentation
Team
Bernhard Pfaff
Lieven Vandenberghe
Show author detailsRolesCopyright holderMartin Andersen
Show author detailsRolesCopyright holderJoachim Dahl
Show author detailsRolesCopyright holder
Insights
Last 30 days
This package has been downloaded 1,282 times in the last 30 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 40 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 14,555 times in the last 365 days. The academic equivalent of having a dedicated subreddit. There are fans, and maybe even a few trolls! The day with the most downloads was Nov 05, 2024 with 114 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports1 package
- Suggests2 packages
- Linking To2 packages
- Reverse Depends1 package
- Reverse Imports1 package
- Reverse Suggests3 packages
- Reverse Enhances1 package