Abstract
The convergence rate of the quasi – Monte Carlo method of search for extremum is examined. It is shown that, if the objective function is nonsingular, then the number of its evaluations required to obtain the desired accuracy ε in the solution can be a slowly (namely, logarithmically) growing function as ε approaches zero.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.