A parallel approximation algorithm for positive semidefinite programming

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 463-471

  Jain, Rahul ^a   Yao, Penghui ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Fast parallel algorithms; multiplicative weight update; positive semidefinite programming

Indexed keywords

APPROXIMATION FACTOR; FAST PARALLEL ALGORITHMS; LINEAR PROGRAMS; MULTIPLICATIVE FACTORS; PARALLEL APPROXIMATION ALGORITHMS; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; WEIGHT UPDATE;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS;

MATHEMATICAL PROGRAMMING;

EID: 84863302833     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.25     Document Type: Conference Paper

References (14)

1. 1=2+o(1) on a quantum computer. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 363-372, Washington, DC, USA, 2007. IEEE Computer Society.
2. S. Arora, E. Hazan, and S. Kale. Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 339-348, 2005.
3. S. Arora and S. Kale. A combinatorial, primal-dual approach to semidefinite programs. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pages 227-236, 2007.
4. Rajendra Bhatia. Matrix Analysis. Springer, New York, USA, 1996.
5. Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, and John Watrous. QIP = PSPACE. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 573-582, New York, NY, USA, 2010. ACM.
6. Rahul Jain, Sarvagya Upadhyay, and John Watrous. Twomessage quantum interactive proofs are in PSPACE. In Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS '09, pages 534-543, Washington, DC, USA, 2009. IEEE Computer Society.
7. Rahul Jain and John Watrous. Parallel approximation of noninteractive zero-sum quantum games. In Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity, CCC '09, pages 243-253, Washington, DC, USA, 2009. IEEE Computer Society.
8. Camille Jordan. Essai sur la géométrie à n dimensions. Bulletin de la S. M. F, 3:103-174, 1875.
9. S. Kale. Efficient algorithms using the multiplicative weights update method. PhD thesis, Princeton University, 2007.
10. Michael Luby and Noam Nisan. A parallel approximation algorithm for positive linear programming. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, STOC '93, pages 448-457, New York, NY, USA, 1993. ACM.
11. Chris Marriott and John Watrous. Quantum Arthur - Merlin games. Comput. Complex., 14:122-152, June 2005.
12. Daniel Nagaj, Pawel Wocjan, and Yong Zhang. Fast amplification of QMA. Quantum Information and Computation, 9(11), 2009.
13. Oded Regev. Witness-preserving QMA amplification, quantum computation lecture notes. 2006.
14. Mario Szegedy. Quantum speed-up of markov chain based algorithms. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 32-41, Washington, DC, USA, 2004. IEEE Computer Society.