Title :
A semidefinite representation for some minimum cardinality problems
Author :
D´Aspremont, Alexandre
Author_Institution :
Dept. of Manage. Sci. & Eng., Stanford Univ., CA, USA
Abstract :
Using techniques developed , we show that some minimum cardinality problems subject to linear inequalities can be represented as finite sequences of semidefinite programs. In particular, we provide a semidefinite representation and a set of successively finer relaxations for the minimum rank problem on positive semidefinite matrices and for the minimum cardinality problem subject to linear inequalities.
Keywords :
linear matrix inequalities; minimisation; polynomial matrices; finite sequences; linear inequalities; minimum cardinality problems; minimum rank problem; positive semidefinite matrices; semidefinite programs; semidefinite representation; Engineering management; Filtering; Laboratories; Large-scale systems; Linear matrix inequalities; Management information systems; Nonlinear filters; Polynomials; Symmetric matrices; Tin;
Conference_Titel :
Decision and Control, 2003. Proceedings. 42nd IEEE Conference on
Print_ISBN :
0-7803-7924-1
DOI :
10.1109/CDC.2003.1272418
