The identification of Hammerstein models for nonlinear systems in considered in a worst-case setting, assuming unknown-but-bounded measurement noise. A new approach is proposed in which the identification of a low-complexity Hammerstein model amounts to the computation of the Chebichev center of a set of matrices conditioned to the manifold of rank-one matrices. An identification algorithm, based on a relaxation technique, is proposed and its consistency is proven. The algorithm is computationally attractive in two cases: noise bounded either in l2 or in l-infinity norm. The effectiveness of the proposed central algorithm and the comparison with the corresponding projection algorithm, which is based on the singular-value decomposition, are investigated both analytically and through numerical examples. In particular, tight error bounds are obtained for the projection algorithm.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||Identification of approximated Hammerstein models in a worst-case setting|
|Citazione:||Garulli, A., Giarre', L., & Zappa, G. (2002). Identification of approximated Hammerstein models in a worst-case setting. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 47(12), 2046-2050.|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: