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.
Version: | 0.4.6 |
Depends: | methods, graphics, Rcpp (≥ 0.10.3) |
LinkingTo: | Rcpp |
Published: | 2015-11-18 |
Author: | Robin Girard |
Maintainer: | Robin Girard <robin.girard at mines-paristech.fr> |
License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
NeedsCompilation: | yes |
CRAN checks: | ConConPiWiFun results |
Reference manual: | ConConPiWiFun.pdf |
Package source: | ConConPiWiFun_0.4.6.tar.gz |
Windows binaries: | r-devel: ConConPiWiFun_0.4.6.zip, r-release: ConConPiWiFun_0.4.6.zip, r-oldrel: ConConPiWiFun_0.4.6.zip |
macOS binaries: | r-release: ConConPiWiFun_0.4.6.tgz, r-oldrel: ConConPiWiFun_0.4.6.tgz |
Old sources: | ConConPiWiFun archive |
Please use the canonical form https://CRAN.R-project.org/package=ConConPiWiFun to link to this page.