In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications such as semidefinite programming relaxations for combinatorial optimization problems, sparse principal component analysis, and sparse variance unfolding techniques for dimension reduction. Our algorithm exploits the structural similarity between semidefinite packing programs and linear packing programs.
No takes yet. Share an insight, caveat, or question.
Iyengar et al. (2011) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: