relation: http://eprints.imtlucca.it/2441/
title: Hammerstein systems parameters bounding through sparse polynomial optimization
creator: Cerone, Vito
creator: Piga, Dario
creator: Regruto, Diego
subject: QA75 Electronic computers. Computer science
description: 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.
publisher: IEEE
date: 2011-06
type: Book Section
type: PeerReviewed
format: application/pdf
language: en
identifier: http://eprints.imtlucca.it/2441/1/ACC2011PreprintPiga.pdf
identifier:   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)  
relation: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5991418&isnumber=5989965
relation: 10.1109/ACC.2011.5991418