Answers are grounded in this paper and cite their sources.
A direct search procedure utilizing pseudo random numbers over a region is presented to solve nonlinear programming problems. After each iteration the size of the region is reduced so that the optimum can be found as accurately as desired. The ease of programming, the speed of convergence, and the reliability of results make the procedure very attractive for solving nonlinear programming problems.
No takes yet. Share an insight, caveat, or question.
Luus et al. (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: