Rate of convergence of recursive estimators

It is proved that the sequence of recursive estimators generated by Ljung’s scheme combined with a suitable restarting mechanism converges under certain conditions with rate $O_M (n^{{{ - 1} / 2}} )$, where the rate is measured by the $L_q $-norm of the estimation error for any $1 \leq q < \infty $.