Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
From MaRDI portal
Publication:5075785
DOI10.4230/LIPIcs.ESA.2019.43OpenAlexW2982028837MaRDI QIDQ5075785
Kazuhisa Makino, Khaled M. Elbassioni
Publication date: 11 May 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11164/pdf/LIPIcs-ESA-2019-43.pdf
approximate solutionslogarithmic potentialsemidefinite programsprimal-dual algorithmspacking and covering
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Sublinear time algorithms for approximate semidefinite programming
- Smoothing technique and its applications in semidefinite optimization
- Robust optimization-methodology and applications
- A sublinear-time randomized approximation algorithm for matrix games
- Approximate Max-Min Resource Sharing for Structured Concave Optimization
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
- Approximating Semidefinite Packing Programs
- A Combinatorial, Primal-Dual Approach to Semidefinite Programs
- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring
- Randomized metarounding
- Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start
- Sparse Sums of Positive Semidefinite Matrices
- An SDP-based algorithm for linear-sized spectral sparsification
- Twice-Ramanujan Sparsifiers
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- A Parallel Approximation Algorithm for Positive Semidefinite Programming
This page was built for publication: Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
