Convex Partition Optimisation R package CPoptim version 0.1.0 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> . Software Depends: R (>= 2.10.0) Erick G.G. de Paz <giles.erick@colpos.mx> Comprehensive R Archive Network (CRAN) Erick G.G. de Paz [aut, cre] (ORCID: <https://orcid.org/0000-0001-7878-8238>), Humberto Vaquera Huerta [aut] (ORCID: <https://orcid.org/0000-0002-2805-804X>), Francisco Javier Albores Velasco [aut] (ORCID: <https://orcid.org/0009-0003-1871-7288>), John R. Bauer Mengelberg [aut] (ORCID: <https://orcid.org/0000-0002-8106-8546>), Juan Manuel Romero Padilla [aut] (ORCID: <https://orcid.org/0000-0002-2654-5266>) GPL-2 2024-07-12 application/tgz https://CRAN.R-project.org/package=CPoptim doi:10.32614/CRAN.package.CPoptim