A new randomized algorithm to approximate the star discrepancy based on threshold accepting
DOI10.1137/110833865zbMATH Open1271.65003OpenAlexW2123331303MaRDI QIDQ2903013FDOQ2903013
Authors: Michael Gnewuch, Magnus Wahlström, Carola Winzen 
Publication date: 23 August 2012
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110833865
Recommendations
- A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy
- A genetic algorithm approach to estimate lower bounds of the star discrepancy
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- Calculation of discrepancy measures and applications
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- Secure pseudorandom bit generators and point sets with low star-discrepancy
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
- Tractability properties of the weighted star discrepancy
- An algorithm to compute bounds for the star discrepancy
Monte Carlo methods (65C05) Randomized algorithms (68W20) Irregularities of distribution, discrepancy (11K38) Number-theoretic algorithms; complexity (11Y16)
Cited In (18)
- A genetic algorithm approach to estimate lower bounds of the star discrepancy
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
- Discrepancy estimates for acceptance-rejection samplers using stratified inputs
- Low-discrepancy point sets for non-uniform measures
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- An algorithm to compute bounds for the star discrepancy
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
- Octagonal symmetry in low-discrepancy \(\beta\)-manganese
- A random walk algorithm to estimate a lower bound of the star discrepancy
- Calculation of discrepancy measures and applications
- Measures of uniformity in experimental designs: a selective overview
- Overcoming the numerical sign problem in the Wigner dynamics via adaptive particle annihilation
- A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy
- Uniform point sets and the collision test
- The inverse of the star-discrepancy problem and the generation of pseudo-random numbers
- Entropy, Randomization, Derandomization, and Discrepancy
- Heuristic approaches to obtain low-discrepancy point sets via subset selection
- A nonlocal functional promoting low-discrepancy point sets
This page was built for publication: A new randomized algorithm to approximate the star discrepancy based on threshold accepting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903013)
