Systematic optimization methods for uniform designs under wrap-around \(L_2\)-discrepancy
摘要
As a successful practice of the quasi-Monte Carlo method in computer experiments, uniform design aims to distribute points evenly on a restricted domain. Such a point set has low discrepancy and has enjoyed increasing popularity in applications. However, most designs obtained by the numerical optimization algorithms in literature are just nearly uniform, thus there is significant room for improvement. This paper reviews the existing work on uniform designs and then characterizes their structure under the wrap-around