relation: http://eprints.imtlucca.it/2443/
title: Computational burden reduction in set-membership Hammerstein system identification
creator: Cerone, Vito
creator: Piga, Dario
creator: Regruto, Diego
subject: QA75 Electronic computers. Computer science
description: 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.
publisher: IFAC
date: 2011
type: Book Section
type: PeerReviewed
format: application/pdf
language: en
identifier: http://eprints.imtlucca.it/2443/1/IFAC2011PreprintPiga.pdf
format: application/pdf
language: en
identifier: http://eprints.imtlucca.it/2443/2/IFAC2011PresentazionePiga.pdf
identifier:   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)  
relation: http://dx.doi.org/10.3182/20110828-6-IT-1002.02090
relation: 10.3182/20110828-6-IT-1002.02090