DocumentCode :
3415042
Title :
A rank minimization heuristic with application to minimum order system approximation
Author :
Fazel, Maryam ; Hindi, Haitham ; Boyd, Stephen P.
Author_Institution :
Stanford Univ., CA, USA
Volume :
6
fYear :
2001
fDate :
2001
Firstpage :
4734
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 :
approximation theory; matrix algebra; minimisation; reduced order systems; linear matrix inequality; minimum order system; reduced order systems; semidefinite program; trace heuristic; Control systems; Eigenvalues and eigenfunctions; Euclidean distance; Fuels; Software standards; Statistical analysis; Symmetric matrices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, 2001. Proceedings of the 2001
Conference_Location :
Arlington, VA
ISSN :
0743-1619
Print_ISBN :
0-7803-6495-3
Type :
conf
DOI :
10.1109/ACC.2001.945730
Filename :
945730
Link To Document :
بازگشت