Optimality of central and projection algorithms for bounded uncertainty (Q1100150): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6911(86)90075-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006142473 / rank | |||
Normal rank | |||
Revision as of 01:39, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality of central and projection algorithms for bounded uncertainty |
scientific article |
Statements
Optimality of central and projection algorithms for bounded uncertainty (English)
0 references
1986
0 references
The authors study the optimality in the sense of Traub and Wozniakowski [see \textit{J. F. Traub} and \textit{H. Wozniakowski}, A general theory of optimal algorithms (1980; Zbl 0441.68046)] of central and projection algorithms for identification of linear systems subject to a norm-bounded noise. It is shown that the least squares algorithms are strongly optimal, while other projection algorithms such as least-absolute-value and minimax algorithms do not possess this property.
0 references
central and projection algorithms
0 references
identification of linear systems
0 references
least squares algorithms
0 references
