eprintid: 2468
rev_number: 7
eprint_status: archive
userid: 6
dir: disk0/00/00/24/68
datestamp: 2015-01-13 13:40:47
lastmod: 2015-01-13 13:40:47
status_changed: 2015-01-13 13:40:47
type: article
metadata_visibility: show
creators_name: Cerone, Vito
creators_name: Piga, Dario
creators_name: Regruto, Diego
creators_id: 
creators_id: dario.piga@imtlucca.it
creators_id: 
title: Bounded error identification of Hammerstein systems through sparse polynomial optimization 
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: public
keywords: Bounded error identification; Hammerstein systems; Parameter bounds; Sparse LMI relaxation
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. 
date: 2012-10
date_type: published
publication: Automatica
volume: 48
number: 10
publisher: Elsevier 
pagerange: 2693 - 2698
id_number: 10.1016/j.automatica.2012.06.078
refereed: TRUE
issn: 0005-1098
official_url: http://www.sciencedirect.com/science/article/pii/S0005109812003482
citation:   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)  
document_url: http://eprints.imtlucca.it/2468/1/Aut2012PigaPreprint.pdf