A Semidefinite Representation for some Minimum Cardinality Problems

Simple item page
dc.creatord'Aspremont, Alexandre
dc.date2003-02-09
dc.date2003-02-27
dc.date.accessioned2026-07-07T04:55:07Z
dc.date.available2026-07-07T04:55:07Z
dc.descriptionUsing 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.
dc.descriptionNo figures, this version removes typos, improves notation and corrects two minor errors in section 3 and 4
dc.identifierhttps://arxiv.org/abs/math/0302092
dc.identifierhttp://arxiv.org/abs/math/0302092
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66477
dc.subjectOptimization and Control
dc.subject90C22;90C27;90C10
dc.titleA Semidefinite Representation for some Minimum Cardinality Problems
dc.typetext

Files

Collections

arXiv