Adaptive step size random search
暂无分享,去创建一个
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.
[1] Samuel H. Brooks. A Discussion of Random Methods for Seeking Maxima , 1958 .
[2] H. H. Rosenbrock,et al. An Automatic Method for Finding the Greatest or Least Value of a Function , 1960, Comput. J..
[3] M. J. D. Powell,et al. An Iterative Method for Finding Stationary Values of a Function of Several Variables , 1962, Comput. J..
[4] John A. Nelder,et al. A Simplex Method for Function Minimization , 1965, Comput. J..