TY  - JOUR
SN  - 0005-1098
ID  - eprints2466
EP  -  2494
N2  - In this paper, we consider the identification of linear systems, a priori known to be stable, from input?output data corrupted by bounded noise. By taking explicitly into account a priori information on system stability, a formal definition of the feasible parameter set for a stable linear system is provided. On the basis of a detailed analysis of the geometrical structure of the feasible set, convex relaxation techniques are presented to solve nonconvex optimization problems arising in the computation of parameter uncertainty intervals. Properties of the computed relaxed bounds are discussed. A simulated example is presented to show the effectiveness of the proposed technique. 
JF  - Automatica
PB  - Elsevier 
IS  - 11
AV  - public
TI  - Enforcing stability constraints in set-membership identification of linear dynamic systems 
SP  - 2488 
UR  - http://www.sciencedirect.com/science/article/pii/S0005109811004067
A1  - Cerone, Vito
A1  - Piga, Dario
A1  - Regruto, Diego
Y1  - 2011/11//
VL  - 47
KW  - Error-in-variables; Linear systems; LMI relaxation;
Set-membership identification; Stability constraints
ER  -