Adaptive Quasi-Monte Carlo Method for Multiple-Extrema Optimization
自适应拟蒙特卡罗多极值优化方法（英文）

Quasi-Monte Carlo random search is useful in nondifferentiable optimization. By borrowing the ideas of population from genetic algorithms, we introduce an adaptive random search in quasi-Monte Carlo method(AQMC) for global optimization. The adaptive search technique enables local search to head for local extrema quickly. The low discrepancy of quasi-random sequence ensures that the function field be searched evenly and various local extrema including global extremum be found.