A Parallel Approximation Algorithm for Positive Semidefinite Programming
Computational Complexity
2011-04-14 v1 Quantum Physics
Abstract
Positive semidefinite programs are an important subclass of semidefinite programs in which all matrices involved in the specification of the problem are positive semidefinite and all scalars involved are non-negative. We present a parallel algorithm, which given an instance of a positive semidefinite program of size N and an approximation factor eps > 0, runs in (parallel) time poly(1/eps) \cdot polylog(N), using poly(N) processors, and outputs a value which is within multiplicative factor of (1 + eps) to the optimal. Our result generalizes analogous result of Luby and Nisan [1993] for positive linear programs and our algorithm is inspired by their algorithm.
Cite
@article{arxiv.1104.2502,
title = {A Parallel Approximation Algorithm for Positive Semidefinite Programming},
author = {Rahul Jain and Penghui Yao},
journal= {arXiv preprint arXiv:1104.2502},
year = {2011}
}
Comments
16 pages