On the rank minimization problem over a positive semidefinite linear matrix inequality
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 42 (2) , 239-243
- https://doi.org/10.1109/9.554402
Abstract
We consider the problem of minimizing the rank of a positive semidefinite matrix, subject to the constraint that an affine transformation of it is also positive semidefinite. Our method for solving this problem employs ideas from the ordered linear complementarity theory and the notion of the least element in a vector lattice. This problem is of importance in many contexts, for example in feedback synthesis problems, and such an example is also providedKeywords
This publication has 7 references indexed in Scilit:
- Control system synthesis via bilinear matrix inequalitiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A cone programming approach to the bilinear matrix inequality problem and its geometryMathematical Programming, 1997
- Solving a class of rank minimization problems via semi-definite programs, with applications to the fixed order output feedback synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- Linear Matrix Inequalities in System and Control TheoryPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985
- A generalization of Brouwer’s fixed point theoremDuke Mathematical Journal, 1941