A Parallel Approximation Algorithm for Positive Semidefinite Programming

DOI10.1109/FOCS.2011.25MaRDI QIDQ5495025zbMATH OpenFDO

Authors Rahul Jain, Penghui Yao

Publication date 30 July 2014

Published in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/FOCS.2011.25

Mathematics Subject Classification ID

Semidefinite programming (90C22) Approximation algorithms (68W25) Parallel algorithms in computer science (68W10)

Cited in

(8)

• A multiplicative weights update algorithm for packing and covering semi-infinite linear programs
• New strong direct product results in communication complexity
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs
• scientific article; zbMATH DE number 7559394 (Why is no real title available?)
• Parallel approximation of min-max problems
• A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
• Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
• ADMM for the SDP relaxation of the QAP

This page was built for publication: A Parallel Approximation Algorithm for Positive Semidefinite Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495025)