%R 10.3182/20110828-6-IT-1002.02090
%B Proceedings of the 18th IFAC World Congress
%X Hammerstein system identification from measurements affected by bounded noise is considered in the paper. First, we show that computation of tight parameter bounds requires the solution to nonconvex optimization problems where the number of decision variables increases with the length of the experimental data sequence. Then, in order to reduce the computational burden of the identification problem, we propose a procedure to relax the previously formulated problem to a set of polynomial optimization problems where the number of variables does not depend on the size of the measurements sequence. Advantages of the presented approach with respect to previously published results are discussed.
%D 2011
%L eprints2443
%A Vito Cerone
%A Dario Piga
%A Diego Regruto
%K Hammerstein systems, Convex relaxation, Parameters bounds, Set-membership identification.
%I IFAC
%O 18th IFAC World Congress, held in Milano (Italy), August 28- September 2nd 2011
%P 13924-13929
%T Computational burden reduction in set-membership Hammerstein system identification