A semidefinite representation for some minimum cardinality problems

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.

[1]  R. Curto,et al.  The truncated complex -moment problem , 2000 .

[2]  Jean B. Lasserre,et al.  An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..

[3]  Pablo A. Parrilo,et al.  Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

[4]  Stephen P. Boyd,et al.  Low-Authority Controller Design by Means of Convex Optimization , 1999 .

[5]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[6]  P. Parrilo,et al.  Symmetry groups, semidefinite programs, and sums of squares , 2002, math/0211450.

[7]  A. Fialkow,et al.  THE TRUNCATED COMPLEX K-MOMENT PROBLEM , 2000 .

[8]  Stephen P. Boyd,et al.  A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[9]  B. Reznick.  Some concrete aspects of Hilbert's 17th Problem , 2000 .

[10]  C. Berg.  The multidimensional moment problem and semi-groups , 1987 .

[11]  Mihai Putinar,et al.  Solving moment problems by dimensional extension , 1999, math/9905215.

[12]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[13]  Stephen P. Boyd,et al.  Low-authority controller design via convex optimization , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[14]  Bruce Reznick,et al.  Sums of squares of real polynomials , 1995 .

[15]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[16]  Truong Q. Nguyen,et al.  Robust and reduced-order filtering: new LMI-based characterizations and methods , 2001, IEEE Trans. Signal Process..

[17]  Yurii Nesterov,et al.  Squared Functional Systems and Optimization Problems , 2000 .

[18]  G. Cassier,et al.  Problème des moments sur un compact de Rn et décomposition de polynômes a plusieurs variables , 1984 .

[19]  B. Reznick.  Extremal PSD forms with few terms , 1978 .

[20]  Olga Taussky-Todd.  SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM , 1996 .

[21]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[22]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[23]  K. Gatermann.  Computer algebra methods for equivariant dynamical systems , 2000 .

[24]  M. Mesbahi.  On the rank minimization problem and its control applications , 1998 .