Robust Subspace System Identification via Weighted Nuclear Norm Optimization

Subspace identification is a classical and very well studied problem in system identification. The problem was recently posed as a convex optimization problem via the nuclear norm relaxation. Inspired by robust PCA, we extend this framework to handle outliers. The proposed framework takes the form of a convex optimization problem with an objective that trades off fit, rank and sparsity. As in robust PCA, it can be problematic to find a suitable regularization parameter. We show how the space in which a suitable parameter should be sought can be limited to a bounded open set of the two dimensional parameter space. In practice, this is very useful since it restricts the parameter space that is needed to be surveyed.

[1]  Paul Tseng,et al.  Hankel Matrix Rank Minimization with Applications to System Identification and Realization , 2013, SIAM J. Matrix Anal. Appl..

[2]  Bart De Moor,et al.  N4SID: Subspace algorithms for the identification of combined deterministic-stochastic systems , 1994, Autom..

[3]  Michel Verhaegen,et al.  Identification of the deterministic part of MIMO state space models given in innovations form from input-output data , 1994, Autom..

[4]  Zhang Liu,et al.  Nuclear norm system identification with missing inputs and outputs , 2013, Syst. Control. Lett..

[5]  H. Akaike,et al.  Information Theory and an Extension of the Maximum Likelihood Principle , 1973 .

[6]  P. J. Huber.  Robust Regression: Asymptotics, Conjectures and Monte Carlo , 1973 .

[7]  Bart De Schutter,et al.  DAISY : A database for identification of systems , 1997 .

[8]  Patrick Dewilde,et al.  Subspace model identification Part 1. The output-error state-space model identification class of algorithms , 1992 .

[9]  Marc Moonen,et al.  A geometrical approach for the identification of state space models with singular value decomposition , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[10]  Stephen P. Boyd,et al.  A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[11]  G. Watson.  Characterization of the subdifferential of some matrix norms , 1992 .

[12]  H. Hotelling.  Analysis of a complex of statistical variables into principal components. , 1933 .

[13]  Ashish Tiwari,et al.  Safety envelope for security , 2014, HiCoNS.

[14]  M. Moonen,et al.  On- and off-line identification of linear state-space models , 1989 .

[15]  Lieven Vandenberghe,et al.  Interior-Point Method for Nuclear Norm Approximation with Application to System Identification , 2009, SIAM J. Matrix Anal. Appl..

[16]  Zhang Liu,et al.  Subspace system identification via weighted nuclear norm optimization , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[17]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[18]  M. Verhaegen.  Subspace model identification Part 2. Analysis of the elementary output-error state-space model identification algorithm , 1992 .

[19]  N. S. Khalid.  On-and off-line identification of linear state space models , 2012 .

[20]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.