A parallel approximation algorithm for mixed packing and covering semidefinite programs

Abstract

We present a parallel approximation algorithm for a class of mixed packing and covering semidefinite programs which generalize on the class of positive semidefinite programs as considered by Jain and Yao [2011]. As a corollary we get a faster approximation algorithm for positive semidefinite programs with better dependence of the parallel running time on the approximation factor, as compared to that of Jain and Yao [2011]. Our algorithm and analysis is on similar lines as that of Young [2001] who considered analogous linear programs.

8 pages, version 1

References in corpus (1)

• Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming

Cited by in corpus (5)

• Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming
• Parallel approximation of min-max problems
• Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms for Solving Inverse Symmetric $M$-Matrices
• Solving SDP Faster: A Robust IPM Framework and Efficient Implementation
• Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent