EconPapers    
Economics at your fingertips  
 

Optimal and suboptimal algorithms in set membership identification

Bolesław Kacewicz

Mathematical and Computer Modelling of Dynamical Systems, 2005, vol. 11, issue 2, 159-169

Abstract: We discuss in this paper optimality properties of identification algorithms in a set membership framework. We deal with restricted-complexity (conditional) identification, where approximations (models) to a possibly complex system are selected from a low dimensional space. We discuss the worst- and average-case settings. In the worst-case setting, we present results on optimality, or suboptimality, of algorithms based on computing the unconditional or conditional Chebyshev centres of an uncertainty set. In the average-case setting, we show that the optimal algorithm is given by the projection of the unconditional Chebyshev centre. We show explicit formulas for its average errors, allowing us to see the contribution of all problem parameters to the minimal error. We discuss the case of weighted average errors corresponding to non-uniform distributions over uncertainty sets, and show how the weights influence the minimal identification error.

Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/13873950500068575 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:nmcmxx:v:11:y:2005:i:2:p:159-169

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/NMCM20

DOI: 10.1080/13873950500068575

Access Statistics for this article

Mathematical and Computer Modelling of Dynamical Systems is currently edited by I. Troch

More articles in Mathematical and Computer Modelling of Dynamical Systems from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().

 
Page updated 2025-03-20
Handle: RePEc:taf:nmcmxx:v:11:y:2005:i:2:p:159-169