Recursion algorithms for search optimization in relative noise. I: Maximal possibilities (Q1101007)

We examine the problems of search optimization in noise whose intensity is functionally connected with the deviation from an unknown extremum. The maximal possibilities of stochastic recursion optimization algorithms relative to these problems are studied. We will analyze variants of these problems for which the order of the maximal possible asymptotic convergence can be evaluated explicitly for these algorithms.