By Topic

A fundamental approach to the convergence analysis of least squares algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Fogel, E. ; Charles Stark Draper Laboratory, Cambridge, MA, USA

The literature dealing with the question of convergence of the least squares (LS) identification algorithm [1]-[10] is usually utilizing the properties of the sequential estimator, e.g., the fact that the sequence of estimates is a Martingale process, if the noise is an independent sequence, has been used to establish convergence in [10]. In this paper emphasis is put on the fact that the least squares estimates are obtained by minimizing a (quadratic) cost functional. Convergence results for a sequence of random variables obtained by minimizing a parameterized random sequence with respect to its parameter are presented. These results in turn are utilized to establish strong convergence (w.p.l and MS) of the LS procedure under milder conditions than those in previous proofs. Landau's recursive algorithms [12]-[14] are shown to be variations of the LS and, thus, their convergence is also established. The self-tuning regulator [19]-[22] is also discussed and the importance of the use of the LS procedure in it is demonstrated. The importance of this paper, beyond extending previous convergence results is in its approach-utilizing the foundation on which LS procedures are based.

Published in:

Automatic Control, IEEE Transactions on  (Volume:26 ,  Issue: 3 )