eprintid: 2441
rev_number: 8
eprint_status: archive
userid: 6
dir: disk0/00/00/24/41
datestamp: 2015-01-09 10:25:09
lastmod: 2015-01-09 10:25:09
status_changed: 2015-01-09 10:25:09
type: book_section
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: Hammerstein systems parameters bounding through sparse polynomial optimization
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: public
keywords: Bounded error identification; Hammerstein systems;  Parameters bounds; Sparse LMI relaxation
note: 2011 American Control Conference, held in San Francisco (USA),
June 29 - July 01, 2011
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.
date: 2011-06
publisher: IEEE
pagerange: 1247-1252
event_title: American Control Conference (ACC), 2011
id_number: 10.1109/ACC.2011.5991418
refereed: TRUE
isbn: 978-1-4577-0080-4
book_title: Proceedings of American Control Conference (ACC), 2011
official_url: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5991418&isnumber=5989965
citation:   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)  
document_url: http://eprints.imtlucca.it/2441/1/ACC2011PreprintPiga.pdf