Crandore Hub

CPoptim

Convex Partition Optimisation

Convex Partition is a black-box optimisation algorithm for single objective real-parameters functions. The basic principle is to progressively estimate and exploit a regression tree similar to a CART (Classification and Regression Tree) of the objective function. For more details see 'de Paz' (2024) <doi:10.1007/978-3-031-62836-8_3> and 'Loh' (2011) <doi:10.1002/widm.8> .

Versions across snapshots

VersionRepositoryFileSize
0.1.0 rolling linux/jammy R-4.5 CPoptim_0.1.0.tar.gz 19.9 KiB
0.1.0 rolling linux/noble R-4.5 CPoptim_0.1.0.tar.gz 19.9 KiB
0.1.0 rolling source/ R- CPoptim_0.1.0.tar.gz 13.5 KiB
0.1.0 latest linux/jammy R-4.5 CPoptim_0.1.0.tar.gz 19.9 KiB
0.1.0 latest linux/noble R-4.5 CPoptim_0.1.0.tar.gz 19.9 KiB
0.1.0 latest source/ R- CPoptim_0.1.0.tar.gz 13.5 KiB
0.1.0 2026-04-26 source/ R- CPoptim_0.1.0.tar.gz 13.5 KiB
0.1.0 2026-04-23 source/ R- CPoptim_0.1.0.tar.gz 13.5 KiB
0.1.0 2026-04-09 windows/windows R-4.5 CPoptim_0.1.0.zip 26.0 KiB
0.1.0 2025-04-20 source/ R- CPoptim_0.1.0.tar.gz 13.5 KiB