A rank minimization heuristic with application to minimum order system approximation
Authors:
- H. HindiHHH. Hindi
- S.P. BoydSBS.P. Boyd
Top Cited Papers
- 1 January 2001
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6 (07431619) , 4734-4739 vol.6
Abstract
We describe a generalization of the trace heuristic that applies to general nonsymmetric, even non-square, matrices, and reduces to the trace heuristic when the matrix is positive semidefinite. The heuristic is to replace the (nonconvex) rank objective with the sum of the singular values of the matrix, which is the dual of the spectral norm. We show that this problem can be reduced to a semidefinite program, hence efficiently solved. To motivate the heuristic, we, show that the dual spectral norm is the convex envelope of the rank on the set of matrices with norm less than one. We demonstrate the method on the problem of minimum-order system approximation.Keywords
This publication has 11 references indexed in Scilit:
- LMITOOL: a package for LMI optimization2002
- Low-Authority Controller Design by Means of Convex OptimizationJournal of Guidance, Control, and Dynamics, 1999
- On the semi-definite programming solution of the least order dynamic output feedback synthesis1999
- Semidefinite ProgrammingSIAM Review, 1996
- Subspace Identification for Linear Systems1996
- Linear Matrix Inequalities in System and Control Theory1994
- Convex Analysis and Minimization Algorithms I1993
- Worst-case/deterministic identification in H/sub infinity /: the continuous-time caseIEEE Transactions on Automatic Control, 1992
- Topics in Matrix Analysis1991
- Weighted Minimum Trace Factor AnalysisPsychometrika, 1982