CPoptim
0.1.0Convex Partition Optimisation
Overview
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 .
Install
Health
- OK2026-08-0513 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- NOTE2026-08-0112 OK · 1 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- OK2026-03-1014 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
Documentation
- Examples that run
- 100%
- Documented parameters
- not tracked
- Return-value docs
- not tracked
- References docs
- 100%
Downloads
Dependencies
Code & Tests
People & History
1 release. R releases are shown for context.
- RR 4.6.0 released · 2026-04-24
- 0.1.0Latest2026-03-10 · current release
- RR 4.5.0 released · 2025-04-11
Package metadata
- First published
- 2024-07-12
- Total releases
- 1 / 2 yrs
- License
- GPL-2 OSI
- Minimum R
- ≥ 2.10.0
- Download size
- 13 KB
- Installed size
- not tracked yet
- With dependencies
- not tracked yet
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("CPoptim")This is what citation() produces when a package has no citation file of its own. If it prints something else, use that.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-08-14, which the citation names so these numbers can be found later. More on citing and the projects behind them.