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> .
| Version: | 0.1.0 |
| Depends: | R (≥ 2.10.0) |
| Published: | 2024-07-12 |
| DOI: | 10.32614/CRAN.package.CPoptim |
| Author: | Erick G.G. de Paz 
[aut, cre],
Humberto Vaquera Huerta
[aut],
Francisco Javier Albores Velasco
[aut],
John R. Bauer Mengelberg
[aut],
Juan Manuel Romero Padilla
[aut] |
| Maintainer: | Erick G.G. de Paz <giles.erick at colpos.mx> |
| License: | GPL-2 |
| NeedsCompilation: | yes |
| CRAN checks: | CPoptim results |
Documentation:
| Reference manual: | CPoptim.pdf |
Downloads:
| Package source: | CPoptim_0.1.0.tar.gz |
| Windows binaries: | r-devel: CPoptim_0.1.0.zip, r-release: CPoptim_0.1.0.zip, r-oldrel: CPoptim_0.1.0.zip |
| macOS binaries: | r-release (arm64): CPoptim_0.1.0.tgz, r-oldrel (arm64): CPoptim_0.1.0.tgz, r-release (x86_64): not available, r-oldrel (x86_64): CPoptim_0.1.0.tgz |
Reverse dependencies:
| Reverse suggests: | nls2 |
Linking:
Please use the canonical form https://CRAN.R-project.org/package=CPoptim to link to this page.