Crandore Hub

pkmon

Least-Squares Estimator under k-Monotony Constraint for Discrete Functions

We implement two least-squares estimators under k-monotony constraint using a method based on the Support Reduction Algorithm from Groeneboom et al (2008) <DOI:10.1111/j.1467-9469.2007.00588.x>. The first one is a projection estimator on the set of k-monotone discrete functions. The second one is a projection on the set of k-monotone discrete probabilities. This package provides functions to generate samples from the spline basis from Lefevre and Loisel (2013) <DOI:10.1239/jap/1378401239>, and from mixtures of splines.

Versions across snapshots

VersionRepositoryFileSize
1.1 rolling linux/jammy R-4.5 pkmon_1.1.tar.gz 65.7 KiB
1.1 rolling linux/noble R-4.5 pkmon_1.1.tar.gz 65.7 KiB
1.1 rolling source/ R- pkmon_1.1.tar.gz 10.6 KiB
1.1 latest linux/jammy R-4.5 pkmon_1.1.tar.gz 65.7 KiB
1.1 latest linux/noble R-4.5 pkmon_1.1.tar.gz 65.7 KiB
1.1 latest source/ R- pkmon_1.1.tar.gz 10.6 KiB
1.1 2026-04-26 source/ R- pkmon_1.1.tar.gz 10.6 KiB
1.1 2026-04-23 source/ R- pkmon_1.1.tar.gz 10.6 KiB
1.1 2026-04-09 windows/windows R-4.5 pkmon_1.1.zip 68.1 KiB
1.1 2025-04-20 source/ R- pkmon_1.1.tar.gz 10.6 KiB