Recursive estimation of minimum eigenvalues of information matrices (Q1094382)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recursive estimation of minimum eigenvalues of information matrices |
scientific article; zbMATH DE number 4025306
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive estimation of minimum eigenvalues of information matrices |
scientific article; zbMATH DE number 4025306 |
Statements
Recursive estimation of minimum eigenvalues of information matrices (English)
0 references
1987
0 references
A recursive procedure is suggested for estimating the minimum eigenvalues of information matrices on the basis of observed data. It is proved that this estimation algorithm has global convergence with probability 1. In the case of parameter identification and stochastic adaptive control, this procedure makes it possible to obtain realizable asymptotically optimal algorithms of stochastic approximation with a scalar gain matrix.
0 references
information matrices
0 references
estimation algorithm
0 references
global convergence
0 references
parameter identification
0 references
stochastic adaptive control
0 references
