Computational burden reduction in set-membership Hammerstein system identification

Cerone, Vito and Piga, Dario and Regruto, Diego Computational burden reduction in set-membership Hammerstein system identification. In: Proceedings of the 18th IFAC World Congress. IFAC, pp. 13924-13929. ISBN 978-3-902661-93-7 (2011)

Preview	PDF (Pre-print version) Download (107kB) | Preview
Preview	PDF - Presentation Download (707kB) | Preview

Abstract

Hammerstein system identification from measurements affected by bounded noise is considered in the paper. First, we show that computation of tight parameter bounds requires the solution to nonconvex optimization problems where the number of decision variables increases with the length of the experimental data sequence. Then, in order to reduce the computational burden of the identification problem, we propose a procedure to relax the previously formulated problem to a set of polynomial optimization problems where the number of variables does not depend on the size of the measurements sequence. Advantages of the presented approach with respect to previously published results are discussed.

Item Type:	Book Section
Identification Number:	https://doi.org/10.3182/20110828-6-IT-1002.02090
Additional Information:	18th IFAC World Congress, held in Milano (Italy), August 28- September 2nd 2011
Uncontrolled Keywords:	Hammerstein systems, Convex relaxation, Parameters bounds, Set-membership identification.
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 11:12
Last Modified:	09 Jan 2015 11:12
URI:	http://eprints.imtlucca.it/id/eprint/2443

Actions (login required)

Edit Item