首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Application of Deterministic Low-Discrepancy Sequences in Global Optimization
Authors:Email author" target="_blank">Sergei?KucherenkoEmail author  Yury?Sytsko
Institution:(1) Imperial College London, SW7 2AZ, UK;(2) Moscow Engineering Physics Institute, 115409 Moscow, Russia
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.
Keywords:global optimization  stochastic optimization  low-discrepancy sequences  multi level single linkage method
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号