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) and 'Loh' (2011) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("CPoptim")

0.1.0 by Erick G.G. de Paz, 2 years ago


Browse source code at https://github.com/cran/CPoptim


Authors: 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]


Documentation:   PDF Manual  


GPL-2 license



Suggested by nls2.


See at CRAN