A Semidefinite Representation for some Minimum Cardinality Problems
最优化与控制
2007-05-23 v2
摘要
Using techniques developed in [Lasserre02], 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 of the minimum rank problem on positive semidefinite matrices. We also use this technique to cast the problem of finding convex lower bounds on the objective as a semidefinite program.
引用
@article{arxiv.math/0302092,
title = {A Semidefinite Representation for some Minimum Cardinality Problems},
author = {Alexandre d'Aspremont},
journal= {arXiv preprint arXiv:math/0302092},
year = {2007}
}
备注
No figures, this version removes typos, improves notation and corrects two minor errors in section 3 and 4