Application of Quasi Monte Carlo Methods in Global Optimization
It has been recognized through theory and practice that uniformly distributed deterministic sequences provide more accurate results than purely random sequences. A quasi Monte Carlo (QMC) variant of a multi level single linkage (MLSL) algorithm for global optimization is compared with an original stochastic MLSL algorithm for a number of test problems of various complexities. An emphasis is made on high dimensional problems. Two different low-discrepancy sequences (LDS) are used and their efficiency is analysed. It is shown that application of LDS can significantly increase the efficiency of MLSL. The dependence of the sample size required for locating global minima on the number of variables is examined. It is found that higher confidence in the obtained solution and possibly a reduction in the computational time can be achieved by the increase of the total sample size N. N should also be increased as the dimensionality of problems grows. For high dimensional problems clustering methods become inefficient. For such problems a multistart method can be more computationally expedient.
Key wordsstochastic methods low-discrepancy sequences multi level single linkage method
Unable to display preview. Download preview PDF.
- 2.I.I. Artobolevski, M.D. Genkin, V.K. Grinkevich, I.M. Sobol’ and R.B. Statnikov, Optimization in the theory of machines by an LP-search, Dokl. Akad. Nauk SSSR (in Russian), 200, 1287–1290 (1971).Google Scholar
- 3.C.G.E. Boender, The Generalized Multinomial Distribution: A Bayesian Analysis and Applications, Ph.D. Dissertation, Erasmus Universiteit Rotterdam, Centrum voor Wiskunde en Informatica (Amsterdam, 1984).Google Scholar
- 6.C.A. Floudas and Panos M. Pardalos (eds.), State of the Art in Global Optimization: Computational Methods and Applications (Princeton University Press, 1996).Google Scholar
- 7.C. Floudas and Panos M. Pardalos (eds.), Encyclopedia of Optimization (Kluwer Academic Publishers, 2001).Google Scholar
- 8.C. Floudas, M. Pardalos Panos, C. Adjiman, W.R. Esposito, Z. Gumus, S.T. Harding, J.L. Klepeis, C.A. Meyer and C.A. Schweiger, Handbook of Test Problems in Local and Global Optimization (Kluwer Academic Publishers, 1999).Google Scholar
- 10.R. Horst and Panos M. Pardalos (eds.), Handbook of Global Optimization (Kluwer Academic Publishers, 1995).Google Scholar
- 11.L. Liberti, Linearity embedded in nonconvex programs, Journal of Global Optimization (to appear).Google Scholar
- 13.NAG Library (2002); http://www.nag.co.uk.Google Scholar
- 20.I.M. Sobol’, Primer for the Monte Carlo Method (CRC press, Florida, 1994).Google Scholar
- 23.I.M. Sobol’, On an estimate of the accuracy of a simple multidimensional search, Soviet Math. Dokl., 26, 398–401 (1982).Google Scholar
- 27.A.G. Sukharev, Optimal strategies of the search for an extremum, Zh. Vychisl. Mat. i Mat. Fiz (in Russian), 11, 910–924 (1971).Google Scholar
- 31.S. Zakovic, Global Optimization Applied to an Inverse Light Scattering Problem, PhD Thesis, University of Hertfordshire (Hartfield, 1997).Google Scholar