directsearch

directsearch is a package for solving unconstrained minimization, without requiring derivatives of the objective. It is particularly useful when evaluations of the objective function are expensive and/or noisy.

It implements a family of direct search methods, and in particular it extends general direct search methods to use randomized methods for improved practical performance and scalability.

Code | Paper