论文信息 - A stochastic method for global optimization

A stochastic method for global optimization

A stochastic method for global optimization is described and evaluated. The method involves a combination of sampling, clustering and local search, and terminates with a range of confidence intervals on the value of the global optimum. Computational results on standard test functions are included as well.

[1] Adri Kester. Asymptotic normality of the number of small distances between random points in a cube , 1975 .

[2] Alan J. Mayne,et al. Towards Global Optimisation 2 , 1976 .

[3] L. Haan,et al. Estimation of the Minimum of a Function Using Order Statistics , 1980 .

[4] Brian Everitt,et al. Cluster analysis , 1974 .

[5] G. van der Hoek,et al. A Numerical Comparison Of Self Scaling Variable Metric Algorithms , 1979 .

[6] R. Hafner,et al. Die asymptotische Verteilung von Koinzidenzen , 1971 .

[7] Wyn L. Price,et al. A Controlled Random Search Procedure for Global Optimisation , 1977, Comput. J..