A Combinatorial, Primal-Dual Approach to Semidefinite Programs

DOI10.1145/2837020zbMath1426.68301OpenAlexW2346816364MaRDI QIDQ3177769

Satyen Kale

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2837020

zbMATH Keywords

semidefinite programmingcombinatorial algorithmsprimal-dual approximation algorithms

Mathematics Subject Classification ID

Semidefinite programming (90C22) Approximation algorithms (68W25)

Related Items (7)

Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving ⋮ Finding Sparse Solutions for Packing and Covering Semidefinite Programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs ⋮ Scalable Semidefinite Programming ⋮ Online learning of quantum states

This page was built for publication: A Combinatorial, Primal-Dual Approach to Semidefinite Programs