scientific article; zbMATH DE number 3974192

From MaRDI portal
Publication:3740143





[For the entire collection see Zbl 0583.00028.] We consider deterministic analogs of random search procedures for approximating the global optimum of a function. These deterministic procedures can be thought of as quasi-Monte Carlo optimization methods or quasi-random search methods. In the analysis of quasi-Monte Carlo methods the following approach is typical: one first tries to establish an effective error bound in terms of a suitable quantity depending on the deterministically selected points, and then one seeks to find those sets of deterministic points that make this quantity as small as possible. For quasi-Monte Carlo optimization the relevant quantity is the so-called dispersion.




Cited in
(29)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740143)