Algorithm 744: A stochastic algorithm for global optimization with constraints A stochastic algorithm is presented for finding the global optimum of a function of $n$ variables subject to general constraints. The algorithm is intended for moderate values of $n$, but it can accommodate objective and constraint functions that are discontinuous and can take advantage of parallel processors. The performance of this algorithm is compared to that of the Nelder-Mead simplex algorithm and a simulated annealing algorithm on a variety of nonlinear functions. In addition, one-, two-, four-, and eight-processor versions of the algorithm are compared using 64 of the nonlinear problems with constraints collected by {it W. Hock} and {it K. Schittkowski} lbrack Test examples for nonlinear programming codes, Lect. Notes Economics and Mathematical Systems 187 (1981; Zbl 452.90038) brack. In general, the algorithm is more robust than the simplex algorithm, but computationally more expensive. The algorithm appears to be as robust as the simulated annealing algorithm, but computationally cheaper. Issues discussed include algorithm speed and robustness, applicability to both computer and mathematical models, and parallel efficiency.
(Source: http://dl.acm.org/)

This software is also peer reviewed by journal TOMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element