Abstract:
A procedure is proposed for estimating the convergence rates of statistical optimization algorithms with continuous time of non-Markov type. Estimates of convergence rate asymptotic as $t\to\infty$ of such Robbins — Monro, Keefer — Wolfowitz, and random search algorithms.