Hammerstein systems parameters bounding through sparse polynomial optimization

Cerone, Vito and Piga, Dario and Regruto, Diego Hammerstein systems parameters bounding through sparse polynomial optimization. In: Proceedings of American Control Conference (ACC), 2011. IEEE, pp. 1247-1252. ISBN 978-1-4577-0080-4 (2011)

Preview

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

Abstract

A single-stage procedure for the evaluation of tight bounds on the parameters of Hammerstein systems from output measurements affected by bounded errors is presented. The identification problem is formulated in terms of polynomial optimization, and relaxation techniques based on linear matrix inequalities are proposed to evaluate parameters bounds by means of convex optimization. The structured sparsity of the identification problem is exploited to reduce the computational complexity of the convex relaxed problem. Convergence proper ties, complexity analysis and advantages of the proposed technique with respect to previously published ones are discussed.

Item Type:	Book Section
Identification Number:	https://doi.org/10.1109/ACC.2011.5991418
Additional Information:	2011 American Control Conference, held in San Francisco (USA), June 29 - July 01, 2011
Uncontrolled Keywords:	Bounded error identification; Hammerstein systems; Parameters 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:	09 Jan 2015 10:25
Last Modified:	09 Jan 2015 10:25
URI:	http://eprints.imtlucca.it/id/eprint/2441

Actions (login required)

Edit Item