A Parallel Approximation Algorithm for Positive Semidefinite Programming
From MaRDI portal
Publication:5495025
DOI10.1109/FOCS.2011.25zbMath1292.90227MaRDI QIDQ5495025
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Semidefinite programming (90C22) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)
Related Items
Finding Sparse Solutions for Packing and Covering Semidefinite Programs ⋮ Parallel approximation of min-max problems ⋮ A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs ⋮ A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs ⋮ ADMM for the SDP relaxation of the QAP ⋮ Unnamed Item ⋮ New Strong Direct Product Results in Communication Complexity ⋮ Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
