Skip to main content
Article thumbnail
Location of Repository

A Parallel Approximation Algorithm for Positive Semidefinite Programming

By Rahul Jain and Penghui Yao

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.Comment: 16 page

Topics: Computer Science - Computational Complexity, Quantum Physics
Year: 2011
OAI identifier: oai:arXiv.org:1104.2502
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.2502 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.