Corpus ID: 211082743

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

  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},
  • Arun Jambulapati, Yin Tat Lee, +2 authors Kevin Tian
  • Published in ArXiv 2020
  • Mathematics, Computer Science
  • 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


    Publications referenced by this paper.

    Variance reduction for matrix games. In Advances in Neural Information Processing Systems

    • Yair Carmon, Yujia Jin, Aaron Sidford, Kevin Tian
    • Proceedings of the Thirty-third Annual Conference on Neural Information Processing Systems,
    • 2019

    Hardness Results for Structured Linear Systems

    • Rasmus Kyng, Peng Zhang
    • Mathematics, Computer Science
    • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2017