In this paper we propose a single-stage procedure for set-membership identification of nonlinear systems in Lur'e form, where the nonlinear block can be modeled by a polynomial with finite and known order. First the problem of computing parameter bounds is formulated in terms of polynomial optimization. Then, by suitably exploiting the peculiar sparsity structure of the problem, a computational efficient convex relaxation approach is proposed for approximating the global optimal solution of the formulated nonconvex optimization problem. The effectiveness of the presented algorithm is shown by means of a simulation example.
['Vito Cerone', 'Valentino Razza', 'Diego Regruto']
A single stage algorithm for set-membership Identification of nonlinear systems in Lur'e form