ResearchTrend.AI
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver

Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver

Zeyuan Allen-Zhu
Y. Lee
L. Orecchia
ArXivPDFHTML

Papers citing "Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver"

5 / 5 papers shown
Title
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification
An SDP-Based Algorithm for Linear-Sized Spectral Sparsification
Y. Lee
He Sun
43
85
0
27 Feb 2017
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
Zeyuan Allen-Zhu
Zhenyu A. Liao
L. Orecchia
124
89
0
16 Jun 2015
Using Optimization to Solve Positive LPs Faster in Parallel
Using Optimization to Solve Positive LPs Faster in Parallel
Zeyuan Allen-Zhu
L. Orecchia
65
56
0
08 Jul 2014
A parallel approximation algorithm for mixed packing and covering semidefinite programs
A parallel approximation algorithm for mixed packing and covering semidefinite programs
Rahul Jain
Penghui Yao
70
14
0
29 Jan 2012
Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming
Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming
Richard Peng
Kanat Tangwongsan
Peng Zhang
109
44
0
24 Jan 2012