ConConPiWiFun
Optimisation with Continuous Convex Piecewise (Linear and Quadratic) Functions
Continuous convex piecewise linear (ccpl) resp. quadratic (ccpq) functions can be implemented with sorted breakpoints and slopes. This includes functions that are ccpl (resp. ccpq) on a convex set (i.e. an interval or a point) and infinite out of the domain. These functions can be very useful for a large class of optimisation problems. Efficient manipulation (such as log(N) insertion) of such data structure is obtained with map standard template library of C++ (that hides balanced trees). This package is a wrapper on such a class based on Rcpp modules.
- Version0.4.6.1
- R versionunknown
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?Yes
- Last release10/14/2020
Team
Robin Girard
Insights
Last 30 days
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
Binaries
Dependencies
- Depends1 package
- Linking To1 package