Robertson, B.; Price, C.; Reale, M. - In: Computational Optimization and Applications 56 (2013) 2, pp. 291-315
A random search algorithm for unconstrained local nonsmooth optimization is described. The algorithm forms a partition on <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$\mathbb{R}^{n}$</EquationSource> </InlineEquation> using classification and regression trees (CART) from statistical pattern recognition. The CART partition defines desirable subsets where the objective...</equationsource></inlineequation>