On the rank minimization problem over a positive semidefinite linear matrix inequality

Mesbahi, M; Papavassilopoulos, G

dc.contributor.author	Mesbahi, M	en
dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T01:45:43Z
dc.date.available	2014-03-01T01:45:43Z
dc.date.issued	1997	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24695
dc.subject	Affine Transformation	en
dc.subject	Indexing Terms	en
dc.subject	Linear Complementarity	en
dc.subject	Linear Matrix Inequality	en
dc.subject	positive semidefinite matrix	en
dc.subject	Vector Lattice	en
dc.title	On the rank minimization problem over a positive semidefinite linear matrix inequality	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/9.554402	en
heal.identifier.secondary	http://dx.doi.org/10.1109/9.554402	en
heal.publicationDate	1997	en
heal.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,	en
heal.journalName	IEEE Transactions on Automatic Control	en
dc.identifier.doi	10.1109/9.554402	en