DIconvex: Finding Patterns of Monotonicity and Convexity in Data

Given an initial set of points, this package minimizes the number of elements to discard from this set such that there exists at least one monotonic and convex mapping within pre-specified upper and lower bounds.

Version: 1.0.0
Depends: lpSolveAPI
Published: 2018-09-20
DOI: 10.32614/CRAN.package.DIconvex
Author: Paul Schneider [aut, ths], Liudmila Karagyaur [aut]
Maintainer: Liudmila Karagyaur <liudmila.karagyaur at usi.ch>
License: GPL-2
NeedsCompilation: no
CRAN checks: DIconvex results

Documentation:

Reference manual: DIconvex.pdf

Downloads:

Package source: DIconvex_1.0.0.tar.gz
Windows binaries: r-devel: DIconvex_1.0.0.zip, r-release: DIconvex_1.0.0.zip, r-oldrel: DIconvex_1.0.0.zip
macOS binaries: r-release (arm64): DIconvex_1.0.0.tgz, r-oldrel (arm64): DIconvex_1.0.0.tgz, r-release (x86_64): DIconvex_1.0.0.tgz, r-oldrel (x86_64): DIconvex_1.0.0.tgz

Linking:

Please use the canonical form https://CRAN.R-project.org/package=DIconvex to link to this page.