A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy

References

[1] M. Alsolami and M. Mascagni, A random walk algorithm to estimate a lower bound of the star discrepancy, Monte Carlo Methods Appl. 28 (2022), no. 4, 341–348. 10.1515/mcma-2022-2125Search in Google Scholar

[2] G. Bhanot, The Metropolis algorithm, Rep. Progr. Phys. 51 (1988), no. 3, 429–457. 10.1088/0034-4885/51/3/003Search in Google Scholar

[3] J. Dick and F. Pillichshammer, Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration, Cambridge University, Cambridge, 2010. 10.1017/CBO9780511761188Search in Google Scholar

[4] C. Doerr, M. Gnewuch and M. Wahlström, Calculation of discrepancy measures and applications, A Panorama of Discrepancy Theory, Lecture Notes in Math. 2107, Springer, Cham (2014), 621–678. 10.1007/978-3-319-04696-9_10Search in Google Scholar

[5] C. Doerr and F.-M. De Rainville, Constructing low star discrepancy point sets with genetic algorithms, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery, New York (2013), 789–796. 10.1145/2463372.2463469Search in Google Scholar

[6] M. Gnewuch, A. Srivastav and C. Winzen, Finding optimal volume subintervals with 𝑘-points and calculating the star discrepancy are NP-hard problems, J. Complexity 25 (2009), no. 2, 115–127. 10.1016/j.jco.2008.10.001Search in Google Scholar

[7] M. Gnewuch, M. Wahlström and C. Winzen, A new randomized algorithm to approximate the star discrepancy based on threshold accepting, SIAM J. Numer. Anal. 50 (2012), no. 2, 781–807. 10.1137/110833865Search in Google Scholar

[8] Y. Li, The computational measure of uniformity, Master’s thesis, Florida State University, 2000. Search in Google Scholar

[9] N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller and E. Teller, Equation of state calculations by fast computing machines, J. Chem. Phys. 21 (1953), no. 6, 1087–1092. 10.1063/1.1699114Search in Google Scholar

[10] W. J. Morokoff and R. E. Caflisch, Quasi-random sequences and their discrepancies, SIAM J. Sci. Comput. 15 (1994), no. 6, 1251–1279. 10.1137/0915077Search in Google Scholar

[11] W. J. Morokoff and R. E. Caflisch, Quasi-Monte Carlo integration, J. Comput. Phys. 122 (1995), no. 2, 218–230. 10.1006/jcph.1995.1209Search in Google Scholar

[12] H. Niederreiter, Discrepancy and convex programming, Ann. Mat. Pura Appl. (4) 93 (1972), 89–97. 10.1007/BF02412017Search in Google Scholar

[13] H. Niederreiter, Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc. 84 (1978), no. 6, 957–1041. 10.1090/S0002-9904-1978-14532-7Search in Google Scholar

[14] G. Ökten, M. Shah and Y. Goncharov, Random and deterministic digit permutations of the Halton sequence, Monte Carlo and Quasi-Monte Carlo Methods 2010, Springer Proc. Math. Stat. 23, Springer, Heidelberg (2012), 609–622. 10.1007/978-3-642-27440-4_35Search in Google Scholar

[15] M. Shah, Quasi-Monte Carlo and genetic algorithms with applications to endogenous mortgage rate computation, Ph.D. thesis, The Florida State University, 2008. Search in Google Scholar

[16] M. Shah, A genetic algorithm approach to estimate lower bounds of the star discrepancy, Monte Carlo Methods Appl. 16 (2010), no. 3–4, 379–398. 10.1515/mcma.2010.014Search in Google Scholar

[17] E. Thiémard, An algorithm to compute bounds for the star discrepancy, J. Complexity 17 (2001), no. 4, 850–880. 10.1006/jcom.2001.0600Search in Google Scholar

[18] E. Thiémard, Optimal volume subintervals with 𝑘 points and star discrepancy via integer programming, Math. Methods Oper. Res. 54 (2001), no. 1, 21–45. 10.1007/s001860100141Search in Google Scholar

[19] P. Winker and K.-T. Fang, Application of threshold-accepting to the evaluation of the discrepancy of a set of points, SIAM J. Numer. Anal. 34 (1997), no. 5, 2028–2042. 10.1137/S0036142995286076Search in Google Scholar