%R 10.1016/j.automatica.2013.05.028
%T A convex relaxation approach to set-membership identification of LPV systems 
%P 2853 - 2859
%J Automatica
%V 49
%N 9
%D 2013
%A Vito Cerone
%A Dario Piga
%A Diego Regruto
%X Abstract Identification of linear parameter varying models is considered in this paper, under the assumption that both the output and the scheduling parameter measurements are affected by bounded noise. First, the problem of computing parameter uncertainty intervals is formulated in terms of nonconvex optimization. Then, on the basis of the analysis of the regressor structure, we present an ad hoc convex relaxation scheme for computing parameter bounds by means of semidefinite optimization. 
%L eprints2473
%K Bounded-error identification; Convex relaxation; Linear parameter varying; LMI relaxation; Parameter bounds
%I Elsevier