An algorithm for finding the global maximum of a multimodal, multivariate function
Tóm tắt
This algorithm for global optimization uses an arbitrary starting point, requires no derivatives, uses comparatively few function evaluations and is not side-tracked by nearby relative optima. The algorithm builds a gradually closer piecewise-differentiable approximation to the objective function. The computer program exhibits a (theoretically expected) strong tendency to cluster around relative optima close to the global. Results of testing with several standard functions are given.
Tài liệu tham khảo
L.C.W. Dixon and G.P. Szegö,Towards global optimisation 2 (North-Holland, Amsterdam 1978).
J. Kiefer, “Sequential minimax search for a maximum“,Proceedings of the American Mathematical Society 4 (1953) 502–506.
S.A. Pijavskii, “An algorithm for finding the absolute extremum of a function”,USSR Computational Mathematics and Mathematical Physics (1972) 57–67.
B. Shubert, “A sequential method seeking the global maximum of a function“,SIAM Journal of Numerical Analysis 9 (3) (1972) 379–388.
A.G. Sukharev, “A stochastic algorithm for extremum search, optimal in one step”,USSR Computational Mathematics and Mathematical Physics (1981) 23–39.
D.J. Wilde,Optimum seeking methods (Prentice Hall, Englewood Cliffs, New Jersey, 1964).