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