TY  - JOUR
UR  - http://www.sciencedirect.com/science/article/pii/S0005109812003482
KW  - Bounded error identification; Hammerstein systems; Parameter bounds; Sparse LMI relaxation
TI  - Bounded error identification of Hammerstein systems through sparse polynomial optimization 
AV  - public
N2  - 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. 
SN  - 0005-1098
EP  -  2698
ID  - eprints2468
IS  - 10
JF  - Automatica
Y1  - 2012/10//
SP  - 2693 
PB  - Elsevier 
A1  - Cerone, Vito
A1  - Piga, Dario
A1  - Regruto, Diego
VL  - 48
ER  -