Answers are grounded in this paper and cite their sources.
Fixed step size random search for minimization of functions of several parameters is described and compared with the fixed step size gradient method for a particular surface. A theoretical technique, using the optimum step size at each step, is analyzed. A practical adaptive step size random search algorithm is then proposed, and experimental experience is reported that shows the superiority of random search over other methods for sufficiently high dimension.
No takes yet. Share an insight, caveat, or question.
Schumer et al. (1968) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: