%B Proceedings of American Control Conference (ACC), 2011
%O 2011 American Control Conference, held in San Francisco (USA),
June 29 - July 01, 2011
%I IEEE
%X 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.
%P 1247-1252
%T Hammerstein systems parameters bounding through sparse polynomial optimization
%K Bounded error identification; Hammerstein systems;  Parameters bounds; Sparse LMI relaxation
%A Vito Cerone
%A Dario Piga
%A Diego Regruto
%L eprints2441
%R 10.1109/ACC.2011.5991418
%D 2011