Least squares identification with stopping
G. Yin · 2003
A stopping-time problem for least-squares identification is studied. The stopping rule is so determined that the recursive online algorithm is terminated if the iterates are inside an ellipsoidal confidence region with small volume, and with limited confidence coefficient close to one. A limit theorem is obtained for the stopped process by means of the weak convergence approach.>