The size of the membership-set in a probabilistic framework.

DOI10.1016/J.AUTOMATICA.2003.10.002zbMath1048.93092OpenAlexW1993241146MaRDI QIDQ1428694

Hüseyin Akçay

Publication date: 29 March 2004

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2003.10.002

zbMATH Keywords

Parameter estimationConfidence intervalBounded noiseError analysisDiameterMembership-set

Mathematics Subject Classification ID

Identification in stochastic control theory (93E12)

Related Items (1)

Convergence analysis of central and minimax algorithms in scalar regressor models

Cites Work

• Unnamed Item
• Unnamed Item
• Letters to the editor on the paper ``Dynamic wavelet and equivalent models
• Convergence properties of the membership set
• Optimal algorithms theory for robust estimation and prediction
• Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor for systems with bounded noise
• Unfalsified weighted least squares estimates in set-membership identification
• Membership set estimators: size, optimal inputs, complexity and relations with least squares
• Bounded error parameter estimation: a sequential analytic center approach
• Convergence results of the analytic center estimator
• On the choice of norms in system identification
• Finite sample properties of system identification methods

This page was built for publication: The size of the membership-set in a probabilistic framework.