Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
I.I. Artobolevskii, 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, vol. 200, pp. 1287–1290, 1971 (in Russian).
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.
P. Bratley, B.L. Fox, and H. Niederreiter, “Implementation and tests of low-discrepancy sequences,” ACM Trans. Model, Comput. Simulation, vol. 2, pp. 195–213, 1992.
L.C.W. Dixon and M. Jha, “Parallel algorithms for global optimization,” Journal of Optimization Theory and Applications, vol. 79, no. l, pp. 385–395, 1993.
C.A. Floudas and Panos M. Pardalos (Eds.), State of the Art in Global Optimization: Computational Methods and Applications, Princeton University Press, 1996.
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.
C. Floudas and P.M. Pardalos (Eds.), Encyclopedia of Optimization, Kluwer Academic Publishers, 2001.
J.H. Holton, “On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals,” Numer. Math, vol. 2, pp. 84–90, 1960.
R. Horst and P.M. Pardalos (Eds.), Handbook of Global Optimization, Kluwer Academic Publishers, 1995.
M. Locatelli and F. Schoen, “Simple linkage: Analysis of a threshold-accepting global optimization method,” Journal of Global Optimization, vol. 9, pp. 95–111, 1996.
NAG Library, http://www.nag.co.uk, 2002.
H. Niederreiter, “Point sets and sequences with small discrepancy,” Monatsh. Math., vol. 104, pp. 273–337, 1987.
H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, SIAM: Philadelphia, 1992.
S. Paskov and J.F. Traub, “Faster evaluation of financial derivatives,” The Journal of Portfolio Management, vol. 22, no. 1, pp. 113–120, 1995.
A.H.G. Rinnooy Kan and G.T. Timmer, “Stochastic global optimization methods, part I, clustering methods,” Mathematical Programming, vol. 39, pp. 27–56, 1987.
A.H.G. Rinnooy Kan and G.T. Timmer, “Stochastic global optimization methods, part II, multilevel methods,” Mathematical Programming, vol. 39, pp. 57–78, 1987.
F. Schoen, “Random and quasi-random linkage methods in global optimization,” Journal of Global Optimization, vol. 13, pp. 445–454, 1998.
I.M. Sobol’, “On the distribution of points in a cube and the approximate evaluation of integrals,” Comput. Math. Math. Phys., vol. 7, pp. 86–112, 1967.
I.M. Sobol’, “On the systematic search in a hypercube,” SIAM J. Numer. Anal., vol. 16, pp. 790–793, 1979.
I.M. Sobol’, “On an estimate of the accuracy of a simple multidimensional search,” Soviet Math. Dokl., vol. 26, pp. 398–401, 1982.
I.M. Sobol’, “On the search for extreme values of functions of several variables satisfying a general Lipschitz condition,” USSR Comput. Math. Math. Phys., vol. 28, pp. 112–118, 1988.
I.M. Sobol’, “An efficient approach to multicriteria optimum design problems,” Survey Math. Ind., vol. 1, pp. 259–281, 1992.
I.M. Sobol’, Primer for the Monte Carlo Method, CRC Press: Florida, 1994.
I.M. Sobol’, “On quasi-Monte Carlo integrations,” Mathematics and Computers in Simulation, vol. 47, pp. 103–112, 1998.
I.M. Sobol’ and B.V. Shukhman, “Integration with quasirandom sequences,” Numerical Experience, Internat. J. Modern Phys. C, vol. 6, no. 2, pp. 263–275, 1995.
A.G. Sukharev, “Optimal strategies of the search for an extremum,” Zh. Vychisl. Mat. i Mat. Fiz, vol. 11, pp. 910–924 1971 (in Russian).
A. Törn and A. Zilinskas, Global Optimization, Lecture Notes in Computer Science 350, Springer: Berlin, 1989.
A. Törn, M. Afi, and S. Vjitanen, “Stochastic global optimization, problem classes and solution techniques,” Journal of Global Optimization, vol. 14, pp. 437–447, 1999.
J.F. Traub and H. Wozniakowski, A General Theory of Optimal Algorithms, Academic Press: New York, 1980.
S. Zakovic, Global Optimization Applied to an Inverse Light Scattering Problem, Ph.D. Thesis, University of Hertfordshire: Hartfield, 1997.
S. Zakovic, Z. Ulanowski, and M.C. Bartholomew-Biggs, “Application of global optimisation to particle identification using light scattering,” Inverse Problems, vol. 14, pp. 1053–1067, 1998.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kucherenko, S., Sytsko, Y. Application of Deterministic Low-Discrepancy Sequences in Global Optimization. Comput Optim Applic 30, 297–318 (2005). https://doi.org/10.1007/s10589-005-4615-1
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10589-005-4615-1