A Combinatorial, Primal-Dual Approach to Semidefinite Programs

DOI10.1145/2837020zbMATH Open1426.68301OpenAlexW2346816364MaRDI QIDQ3177769FDOQ3177769

Sanjeev Arora, 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)

Cited In (11)

• Title not available (Why is that?)
• Primal-dual partitions in linear semi-infinite programming with bounded coefficients
• Online learning of quantum states
• Scalable Semidefinite Programming
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
• Approximation and Online Algorithms
• Riemannian Langevin algorithm for solving semidefinite programs
• Title not available (Why is that?)
• Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
• Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs

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

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