Information-based complexity and nonparamteric worst-case system identification (Q1330145): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Mario Milanese / rank | |||
Property / author | |||
Property / author: Antonio Vicino / rank | |||
Property / reviewed by | |||
Property / reviewed by: Wenhuan Yu / rank | |||
Property / author | |||
Property / author: Mario Milanese / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Antonio Vicino / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Wenhuan Yu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jcom.1993.1028 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2086982388 / rank | |||
Normal rank |
Latest revision as of 02:01, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Information-based complexity and nonparamteric worst-case system identification |
scientific article |
Statements
Information-based complexity and nonparamteric worst-case system identification (English)
0 references
17 August 1994
0 references
The paper is a survey of nonparametric approaches to identification of linear dynamic systems under nonprobabilistic assumptions on uncertains. The authors, first, introduce definitions and basic results of the information-based complexity (IBC) theory, used in the paper. Nonparametric approaches developed in the last few years can be classified in two main categories, according to the norm in which the estimation errors are measured: \(H_ \infty\) and \(l_ 1\) methods. The \(H_ \infty\) setting assumes that the true system is linear time- invariant and the available information is represented by samples of frequence response of the system, corrupted by an \(l_ \infty\)-norm bound noise. The aim is to estimate a proper, stable finite-dimensional model. In the \(l_ 1\) setting, the aim is to identify the samples of the impulse of an unknown linear time-invariant system. They provide recent results on \(H_ \infty\), \(l_ 1\), and \(l_ \infty\) identification, with particular attention to (a) evaluation of the diameter of information, (b) convergence to zero of the diameter of information, and (c) computation of optimal and almost-optimal algorithms.
0 references
information-based complexity theory
0 references
almost-optimal algorithms
0 references