TY - JOUR
T1 - Enforcing stability constraints in set-membership identification of linear dynamic systems
AU - Cerone, V.
AU - Piga, D.
AU - Regruto, D.
PY - 2011
Y1 - 2011
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
AB - 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
U2 - 10.1016/j.automatica.2011.08.034
DO - 10.1016/j.automatica.2011.08.034
M3 - Article
SN - 0005-1098
VL - 47
SP - 2488
EP - 2494
JO - Automatica
JF - Automatica
IS - 11
ER -