Heuristic direct-search minimization

A new heuristic direct-search minimization algorithm is presented. The algorithm consists of global and local search strategies. Improved performance versus other direct-search algorithms is shown by a performance comparison on standard test functions.