Fetching the paper…
Reading the bibliography…
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis \cite{Kale07}.
Zur theorie der gesellschaftsspiele
J. von Neumann · 1928
Earlier work this paper cites.
On relating time and space to size and depth
A. Borodin · 1977
Earlier work this paper cites.
Fast parallel matrix and GCD computations
A. Borodin, J. von zur Gathen, and J. Hopcroft · 1982
Earlier work this paper cites.
Parallel computation for well-endowed rings and space-bounded probabilistic machines
A. Borodin, S. Cook, and N. Pippenger · 1983
Earlier work this paper cites.
Trading group theory for randomness
L. Babai · 1985
Earlier work this paper cites.
The knowledge complexity of interactive proof systems
S. Goldwasser, S. Micali, and C. Rackoff · 1985
Earlier work this paper cites.
Fast approximation algorithm for fractional packing and covering problems
S.A. Plotkin, D.B. Shmoys, and T. Tardos · 1991
Earlier work this paper cites.
Parallel linear algebra
J. von zur Gathen · 1993
Earlier work this paper cites.
Interior point methods in semidefinite programming with applications to combinatorial optimization
F. Alizadeh · 1995
Earlier work this paper cites.
Randomized rounding without solving the linear program
N.E. Young · 1995
Earlier work this paper cites.
Semidefinite programming
L. Vandenberghe and S. Boyd · 1996
Earlier work this paper cites.
Matrix Analysis
R. Bhatia · 1997
Earlier work this paper cites.
Making games short
U. Feige and J. Kilian · 1997
Earlier work this paper cites.
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
N. Garg and J. Könemann · 1998
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Y. Freund and R.E. Schapire · 1999
Cited alongside, same era.
Approximating fractional multicommodity flow independent of the number of commodities
L.K. Fleischer · 2000
Cited alongside, same era.
Parallelization, amplification, and exponential time simulation of quantum interactive proof system
A. Kitaev and J. Watrous · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Cited alongside, same era.
Approximation Algorithms
V. Vazirani · 2001
Cited alongside, same era.
Aspects of Semidefinite Programming – Interior Point Algorithms and Selected Applications
E. de Klerk · 2002
Cited alongside, same era.
Approximate Convex Optimization by Online Game Playing
E. Hazan · 2006
Later among the works it cites.
Online variance minimization
M. Warmuth and D. Kuzmin · 2006
Later among the works it cites.
A combinatorial, primal-dual approach to semidefinite programs
S. Arora and S. Kale · 2007
Later among the works it cites.
Toward a general theory of quantum games
G. Gutoski and J. Watrous · 2007
Later among the works it cites.
Efficient algorithms using the multiplicative weights update method
S. Kale · 2007
Later among the works it cites.
Optimal algorithms and inapproximability results for every CSP?
P. Raghavendra · 2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Classical and Quantum Computation
A. Kitaev, A. Shen, M. Vyalyi · 2002
Cited alongside, same era.
Semidefinite programs and combinatorial optimization
L. Lovasz · 2003
Cited alongside, same era.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Cited alongside, same era.
Lagrangian Relaxation based Algorithms for Convex Programming Problems
R. Khandekar · 2004
Cited alongside, same era.
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
S. Arora, E. Hazan, and S. Kale · 2005
Cited alongside, same era.
The multiplicative weights update method: a meta algorithm and applications. 2005
S. Arora, E. Hazan, and S. Kale · 2005
Cited alongside, same era.
J. Watrous · 2008
Later among the works it cites.
Two-message quantum interactive proofs are in PSPACE
R. Jain, S. Upadhyay, and J. Watrous · 2009
Later among the works it cites.
Parallel approximation of non-interactive zero-sum quantum games
R. Jain and J. Watrous · 2009
Later among the works it cites.
Semidefinite programs for completely bounded norms
J. Watrous · 2009
Later among the works it cites.
Quantum interative proofs with short messages
S. Beigi, P.W. Shor and J. Watrous · 2010
Closest in time.
The convex optimization approach to regret minimization
E. Hazan · 2010
Closest in time.
QIP = PSPACE
R. Jain, Z. Ji, S. Upadhyay, and J. Watrous · 2010
Closest in time.
Fast SDP Algorithms for Constraint Satisfaction Problems
David Steurer · 2010
Closest in time.