A combinatorial, primal-dual approach to semidefinite programs

DOI10.1145/2837020MaRDI QIDQ3177769zbMATH OpenOpenAlexFDO

Authors Satyen Kale, Sanjeev Arora

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)

Recommendations

• Semidefinite programming and combinatorial optimization
• Approximation algorithms and semidefinite programming.
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• scientific article; zbMATH DE number 1256751

Cited in

(14)

• Online learning of quantum states
• Scalable semidefinite programming
• Primal-dual partitions in linear semi-infinite programming with bounded coefficients
• Product Theorems Via Semidefinite Programming
• Sparse Approximate Solutions to Semidefinite Programs
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs
• Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
• scientific article; zbMATH DE number 7651209 (Why is no real title available?)
• Product Rules in Semidefinite Programming
• Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
• Approximation and Online Algorithms
• scientific article; zbMATH DE number 7561592 (Why is no real title available?)
• Riemannian Langevin algorithm for solving 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)