Fetching the paper…
Reading the bibliography…
We study semidefinite programs with diagonal constraints.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
Exponential Operators and Parameter Differentiation in Quantum Physics
R. M. Wilcox · 1967
Earlier work this paper cites.
Reducibility among combinatorial problems
R. Karp · 1972
Earlier work this paper cites.
A graph-theoretic via minimization algorithm for two-layer printed circuit boards
Ruen-Wu Chen, Yoji Kajitani, and Shu-Park Chan · 1983
Earlier work this paper cites.
Extensions of lipschitz mappings into a hilbert space
William B Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
An application of combinatorial optimization to statistical physics and circuit layout design
Francisco Barahona, Martin Grötschel, Michael Jünger, and Gerhard Reinelt · 1988
Earlier work this paper cites.
Fast approximation algorithms for fractional packing and covering problems
S. A. Plotkin, D. B. Shmoys, and E. Tardos · 1991
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X Goemans and David P Williamson · 1995
Earlier work this paper cites.
The convex analysis of unitarily invariant matrix functions
Adrian S Lewis · 1995
Earlier work this paper cites.
Efficient approximation algorithms for semidefinite programs arising from max cut and coloring
Philip Klein and Hsueh-I Lu · 1996
Earlier work this paper cites.
The complexity of the matrix eigenproblem
Victor Y. Pan and Zhao Q. Chen · 1999
Earlier work this paper cites.
Convex Optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Rank minimization and applications in system theory
M. Fazel, H. Hindi, and S. Boyd · 2004
Earlier work this paper cites.
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2005
Earlier work this paper cites.
Rank, trace-norm and max-norm
Nathan Srebro and Adi Shraibman · 2005
Earlier work this paper cites.
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora and Satyen Kale · 2007
Earlier work this paper cites.
Optimal inapproximability results for max-cut and other 2-variable csps?
Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell · 2007
Cited alongside, same era.
The geometry of logconcave functions and sampling algorithms
László Lovász and Santosh Vempala · 2007
Cited alongside, same era.
Sparse approximate solutions to semidefinite programs
Elad Hazan · 2008
Cited alongside, same era.
Large deviations of vector-valued martingales in 2-smooth normed spaces
Anatoli Juditsky and Arkadii S Nemirovski · 2008
Cited alongside, same era.
Applications of strong convexity–strong smoothness duality to learning with matrices
Sham M. Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Cited alongside, same era.
Exact recovery in the stochastic block model
Emmanuel Abbe, Afonso S Bandeira, and Georgina Hall · 2015
Later among the works it cites.
Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel
Zeyuan Allen-Zhu and Lorenzo Orecchia · 2015
Later among the works it cites.
Convex optimization: Algorithms and complexity
Sébastien Bubeck et al · 2015
Later among the works it cites.
Phase recovery, maxcut and complex semidefinite programming
Irène Waldspurger, Alexandre d’Aspremont, and Stéphane Mallat · 2015
Later among the works it cites.
Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver
Zeyuan Allen Zhu, Yin Tat Lee, and Lorenzo Orecchia · 2016
Later among the works it cites.
Sublinear time algorithms for approximate semidefinite programming
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yurii Nesterov · 2009
Cited alongside, same era.
How to round any csp
Prasad Raghavendra and David Steurer · 2009
Cited alongside, same era.
Sparse Convex Optimization Methods for Machine Learning
Martin Jaggi · 2011
Cited alongside, same era.
Three-dimensional structure determination from common lines in cryo-em by eigenvectors and semidefinite programming
Amit Singer and Yoel Shkolnisky · 2011
Cited alongside, same era.
A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems
Michel Baes, Michael Bürgisser, and Arkadi Nemirovski · 2013
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Dan Garber and Elad Hazan · 2016
Later among the works it cites.
Community detection in sparse networks via grothendieck’s inequality
Olivier Guédon and Roman Vershynin · 2016
Later among the works it cites.
Variance-reduced and projection-free stochastic optimization
Elad Hazan and Haipeng Luo · 2016
Later among the works it cites.
Semidefinite programs on sparse random graphs and their application to community detection
Andrea Montanari and Subhabrata Sen · 2016
Later among the works it cites.
Semidefinite programs on sparse random graphs and their application to community detection
Andrea Montanari and Subhabrata Sen · 2016
Later among the works it cites.
Follow the compressed leader: faster online learning of eigenvectors and faster mmwu
Zeyuan Allen-Zhu and Yuanzhi Li · 2017
Later among the works it cites.
Solving sdps for synchronization and maxcut problems via the grothendieck inequality
Song Mei, Theodor Misiakiewicz, Andrea Montanari, and Roberto Imbuzeiro Oliveira · 2017
Later among the works it cites.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Later among the works it cites.
A rank-1 sketch for matrix multiplicative weights
Yair Carmon, John C. Duchi, Aaron Sidford, and Kevin Tian · 2019
Closest in time.
Scalable semidefinite programming, 2019
Alp Yurtsever, Joel A. Tropp, Olivier Fercoq, Madeleine Udell, and Volkan Cevher · 2019
Closest in time.