Fetching the paper…
Reading the bibliography…
A number of statistical estimation problems can be addressed by semidefinite programs (SDP).
J Kuczyński and H Woźniakowski, Estimating the largest eigenvalue by the power and lanczos algorithms with a random start , SIAM journal on matrix analysis and applications 13
1992
Earlier work this paper cites.
Alexander I. Barvinok, Problems of distance geometry and convex properties of quadratic maps , Discrete & Computational Geometry 13
1995
Earlier work this paper cites.
Michel X Goemans and David P Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , Journal of the ACM (JACM) 42
1995
Earlier work this paper cites.
Alexander Grothendieck, Résumé de la théorie métrique des produits tensoriels topologiques , Resenhas do Instituto de Matemática e Estatística da Universidade de São Paulo 2
1996
Earlier work this paper cites.
Gábor Pataki, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues , Mathematics of operations research 23
1998
Earlier work this paper cites.
Iain M Johnstone, On the distribution of the largest eigenvalue in principal components analysis , Annals of statistics (2001), 295–327
2001
Earlier work this paper cites.
Samuel Burer and Renato DC Monteiro, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , Mathematical Programming 95
2003
Earlier work this paper cites.
Joel Friedman, A proof of alon’s second eigenvalue conjecture , Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, ACM, 2003, pp. 720–724
2003
Earlier work this paper cites.
Sanjeev Arora, Elad Hazan, and Satyen Kale, Fast algorithms for approximate semidefinite programming using the multiplicative weights update method , Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on, IEEE, 2005, pp. 339–348
2005
Earlier work this paper cites.
Jinho Baik, Gérard Ben Arous, Sandrine Péché, et al., Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices , The Annals of Probability 33
2005
Earlier work this paper cites.
P-A Absil, Christopher G Baker, and Kyle A Gallivan, Trust-region methods on Riemannian manifolds , Foundations of Computational Mathematics 7
2007
Earlier work this paper cites.
Sanjeev Arora and Satyen Kale, A combinatorial, primal-dual approach to semidefinite programs , Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, ACM, 2007, pp. 227–236
2007
Earlier work this paper cites.
Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell, Optimal inapproximability results for max-cut and other 2-variable csps? , SIAM Journal on Computing 37
2007
Cited alongside, same era.
Satish Babu Korada and Nicolas Macris, Exact solution of the gauge symmetric p-spin glass model on a complete graph , Journal of Statistical Physics 136
2009
Cited alongside, same era.
Greg W Anderson, Alice Guionnet, and Ofer Zeitouni, An introduction to random matrices , vol. 118, Cambridge university press, 2010
2010
Cited alongside, same era.
2010
Cited alongside, same era.
Dan Garber and Elad Hazan, Approximating semidefinite programs in sublinear time , Advances in Neural Information Processing Systems, 2011, pp. 1080–1088
Laurent Massoulié, Community detection thresholds and the weak ramanujan property , Proceedings of the 46th Annual ACM Symposium on Theory of Computing, ACM, 2014, pp. 694–703
2014
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
Emmanuel Abbe, Afonso S Bandeira, and Georgina Hall, Exact recovery in the stochastic block model , IEEE Transactions on Information Theory 62
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
Amit Singer, Angular synchronization by eigenvectors and semidefinite programming , Applied and computational harmonic analysis 30
2011
Cited alongside, same era.
Amit Singer and Yoel Shkolnisky, Three-dimensional structure determination from common lines in cryo-em by eigenvectors and semidefinite programming , SIAM journal on imaging sciences 4
2011
Cited alongside, same era.
Mica Arie-Nachimson, Shahar Z Kovalsky, Ira Kemelmacher-Shlizerman, Amit Singer, and Ronen Basri, Global motion estimation from point matches , 3D Imaging, Modeling, Processing, Visualization and Transmission (3DIMPVT), 2012 Second International Conference on, IEEE, 2012, pp. 81–88
2012
Cited alongside, same era.
Subhash Khot and Assaf Naor, Grothendieck-type inequalities in combinatorial optimization , Communications on Pure and Applied Mathematics 65
2012
Cited alongside, same era.
2013
Cited alongside, same era.
Yurii Nesterov, Introductory lectures on convex optimization: A basic course , vol. 87, Springer Science & Business Media, 2013
2013
Cited alongside, same era.
Afonso S Bandeira, Moses Charikar, Amit Singer, and Andy Zhu, Multireference alignment using semidefinite programming , Proceedings of the 5th conference on Innovations in theoretical computer science, ACM, 2014, pp. 459–470
2014
Cited alongside, same era.
2016
Later among the works it cites.
Nicolas Boumal, Vlad Voroninski, and Afonso Bandeira, The non-convex burer-monteiro approach works on smooth semidefinite programs , Advances in Neural Information Processing Systems, 2016, pp. 2757–2765
2016
Later among the works it cites.
Olivier Guédon and Roman Vershynin, Community detection in sparse networks via grothendieck’s inequality , Probability Theory and Related Fields 165
2016
Later among the works it cites.
Bruce Hajek, Yihong Wu, and Jiaming Xu, Achieving exact cluster recovery threshold via semidefinite programming , IEEE Transactions on Information Theory 62
2016
Later among the works it cites.
Adel Javanmard, Andrea Montanari, and Federico Ricci-Tersenghi, Phase transitions in semidefinite relaxations , Proceedings of the National Academy of Sciences 113
2016
Later among the works it cites.
Andrea Montanari, A Grothendieck-type inequality for local maxima , arXiv:1603.04064
2016
Later among the works it cites.
Ankur Moitra, William Perry, and Alexander S Wein, How robust are reconstruction thresholds for community detection? , Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, ACM, 2016, pp. 828–841
2016
Later among the works it cites.
Andrea Montanari and Subhabrata Sen, Semidefinite programs on sparse random graphs and their application to community detection , Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, ACM, 2016, pp. 814–827
2016
Later among the works it cites.