Nothing
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> .
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Erick G.G. de Paz [aut, cre] (<https://orcid.org/0000-0001-7878-8238>), Humberto Vaquera Huerta [aut] (<https://orcid.org/0000-0002-2805-804X>), Francisco Javier Albores Velasco [aut] (<https://orcid.org/0009-0003-1871-7288>), John R. Bauer Mengelberg [aut] (<https://orcid.org/0000-0002-8106-8546>), Juan Manuel Romero Padilla [aut] (<https://orcid.org/0000-0002-2654-5266>) |
| Maintainer | Erick G.G. de Paz <giles.erick@colpos.mx> |
| License | GPL-2 |
| Version | 0.1.0 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the CPoptim package in your browser
Any scripts or data that you put into this service are public.
