On strong consistency of least squares identification algorithms

From MaRDI portal
Publication:1254224

DOI10.1016/0005-1098(78)90010-9zbMath0398.93056OpenAlexW2001221332MaRDI QIDQ1254224

John B. Moore

Publication date: 1978

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0005-1098(78)90010-9




Related Items (18)

Identification and adaptation with binary-valued observations under non-persistent excitation conditionConvergence and logarithm laws of self-tuning regulatorsStrong consistency of recursive identification by no use of persistent excitation conditionSome informal scenarios of player behavior and equilibrium computation processes in games under incomplete informationConvergence rate of least-squares identification and adaptive control for stochastic systems†Performance analysis of the compressed distributed least squares algorithmState inverse and decorrelated state stochastic approximationDetection techniques in least squares identificationAsymptotic properties of projections with applications to stochastic regression problemsTracking randomly varying parameters: Analysis of a standard algorithmConvergence of the generalized dual control algorithmA strong law of large numbers for local martingalesEstimating the parameters of autoregression processes by the method of least squaresOn ARX(\(\infty)\) approximationStrong consistency of maximum quasi-likelihood estimators in generalized linear models with fixed and adaptive designsAsymptotic canonical forms and iterated logarithm rate results of least squares estimates for unstable ARMA modelsQuasi-least-squares identification and its strong consistencyConsistency of least-square estimates of parameters of linear difference equations with autocorrelation noise



Cites Work


This page was built for publication: On strong consistency of least squares identification algorithms