Bounded error identification of Hammerstein systems through sparse polynomial optimization

V. Cerone, D. Piga, D. Regruto

Research output: Contribution to journalArticleAcademicpeer-review

25 Citations (Scopus)

Abstract

In this paper we present a procedure for the evaluation of bounds on the parameters of Hammerstein systems, from output measurements affected by bounded errors. The identification problem is formulated in terms of polynomial optimization, and relaxation techniques, based on linear matrix inequalities, are proposed to evaluate parameter bounds by means of convex optimization. The structured sparsity of the formulated identification problem is exploited to reduce the computational complexity of the convex relaxed problem. Analysis of convergence properties and computational complexity is reported.
Original languageEnglish
Pages (from-to)2693-2698
JournalAutomatica
Volume48
Issue number10
DOIs
Publication statusPublished - 2012

Fingerprint

Dive into the research topics of 'Bounded error identification of Hammerstein systems through sparse polynomial optimization'. Together they form a unique fingerprint.

Cite this