Recurrent algorithms of search optimization in the presence of relative noise. I. Utmost potential

Search optimization is discussed in the presence of noise whose intensity is functionally related with deviation from the desired maximum point. The utmost potential of recurrent stochastic algorithms is analyzed in application to such problems. Problem varieties are analyzed for which the order of the fastest possible asymptotic rate of convergence is estimated explicitly for such algorithms.