# Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent

@article{Jambulapati2020PositiveSP, title={Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent}, author={Arun Jambulapati and Yin Tat Lee and Jerry Li and Swati Padmanabhan and Kevin Tian}, journal={ArXiv}, year={2020}, volume={abs/2002.04830} }

We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent applications in combinatorial optimization, robust learning, and quantum complexity. The current approximate solvers for positive semidefinite programming can handle only pure packing instances, and technical hurdles prevent their generalization to a wider class… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 50 REFERENCES