Bounded error identification of Hammerstein systems through sparse polynomial optimization

Cerone, Vito and Piga, Dario and Regruto, Diego Bounded error identification of Hammerstein systems through sparse polynomial optimization. Automatica, 48 (10). 2693 - 2698. ISSN 0005-1098 (2012)

Preview

PDF (Pre-print version) Download (136kB) | Preview

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.

Item Type:	Article
Identification Number:	https://doi.org/10.1016/j.automatica.2012.06.078
Uncontrolled Keywords:	Bounded error identification; Hammerstein systems; Parameter bounds; Sparse LMI relaxation
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area:	Computer Science and Applications
Depositing User:	Ms T. Iannizzi
Date Deposited:	13 Jan 2015 13:40
Last Modified:	13 Jan 2015 13:40
URI:	http://eprints.imtlucca.it/id/eprint/2468

Actions (login required)

Edit Item