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.

Depends: methods, graphics, Rcpp (≥ 0.10.3)
LinkingTo: Rcpp
Published: 2020-10-14
DOI: 10.32614/CRAN.package.ConConPiWiFun
Author: Robin Girard
Maintainer: Robin Girard <robin.girard at>
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.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): ConConPiWiFun_0.4.6.1.tgz, r-oldrel (arm64): ConConPiWiFun_0.4.6.1.tgz, r-release (x86_64): ConConPiWiFun_0.4.6.1.tgz, r-oldrel (x86_64): ConConPiWiFun_0.4.6.1.tgz
Old sources: ConConPiWiFun archive


Please use the canonical form to link to this page.