Fetching the paper…
Reading the bibliography…
We consider semidefinite programs (SDPs) with equality constraints.
Rockafellar, R. Convex analysis , Princeton University Press, Princeton, NJ, 1970
1970
Earlier work this paper cites.
Golub, G. H.; Pereyra, V. The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM Journal on Numerical Analysis 10
1973
Earlier work this paper cites.
Murty, K.; Kabadi, S. Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming 39
1987
Earlier work this paper cites.
Nesterov, Y.; Nemirovskii, A. Interior-point polynomial algorithms in convex programming , SIAM, 1994
1994
Earlier work this paper cites.
Barvinok, A. Problems of distance geometry and convex properties of quadratic maps. Discrete & Computational Geometry 13
1995
Earlier work this paper cites.
Goemans, M.; Williamson, D. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM) 42
1995
Earlier work this paper cites.
Laurent, M.; Poljak, S. On the facial structure of the set of correlation matrices. SIAM Journal on Matrix Analysis and Applications 17
1996
Earlier work this paper cites.
Alizadeh, F.; Haeberly, J.-P.; Overton, M. Complementarity and nondegeneracy in semidefinite programming. Mathematical Programming 77
1997
Earlier work this paper cites.
Pataki, G. 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.
Burer, S.; Monteiro, R. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming 95
2003
Earlier work this paper cites.
Burer, S.; Monteiro, R. Local minima and convergence in low-rank semidefinite programming. Mathematical Programming 103
2005
Earlier work this paper cites.
Ruszczyński, A. Nonlinear optimization , Princeton University Press, Princeton, NJ, 2006
2006
Cited alongside, same era.
Absil, P.-A.; Baker, C. G.; Gallivan, K. A. Trust-region methods on Riemannian manifolds. Foundations of Computational Mathematics 7
2007
Cited alongside, same era.
Polik, I.; Terlaky, T. A survey of the S-lemma. SIAM Review 49
2007
Cited alongside, same era.
Absil, P.-A.; Mahony, R.; Sepulchre, R. Optimization Algorithms on Matrix Manifolds , Princeton University Press, Princeton, NJ, 2008
2008
Cited alongside, same era.
Journée, M.; Bach, F.; Absil, P.-A.; Sepulchre, R. Low-rank optimization on the cone of positive semidefinite matrices. SIAM Journal on Optimization 20
2010
Cited alongside, same era.
Abbé, E.; Bandeira, A.; Hall, G. Exact recovery in the stochastic block model. Information Theory, IEEE Transactions on 62
2016
Later among the works it cites.
Bandeira, A.; Boumal, N.; Voroninski, V.: On the low-rank approach for semidefinite programs arising in synchronization and community detection, in Proceedings of The 29th Conference on Learning Theory, COLT 2016, New York, NY, June 23–26 , 2016
2016
Later among the works it cites.
Bandeira, A.; Kennedy, C.; Singer, A. Approximating the little Grothendieck problem over the orthogonal and unitary groups. Mathematical Programming (2016), 1–43
2016
Later among the works it cites.
Boumal, N.; Voroninski, V.; Bandeira, A. The non-convex Burer–Monteiro approach works on smooth semidefinite programs. in Advances in Neural Information Processing Systems 29 , edited by D. D. Lee; M. Sugiyama; U. V. Luxburg; I. Guyon; R. Garnett, pp. 2757–2765, Curran Associates, Inc., 2016
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…
Khot, S.; Naor, A. Grothendieck-type inequalities in combinatorial optimization. Communications on Pure and Applied Mathematics 65
2012
Cited alongside, same era.
Lee, J. Introduction to Smooth Manifolds , Graduate Texts in Mathematics , vol. 218, Springer-Verlag New York, 2012, 2nd ed
2012
Cited alongside, same era.
Wen, Z.; Yin, W. A feasible method for optimization with orthogonality constraints. Mathematical Programming 142
2013
Cited alongside, same era.
Yang, W.; Zhang, L.-H.; Song, R. Optimality conditions for the nonlinear programming problems on Riemannian manifolds. Pacific Journal of Optimization 10
2014
Cited alongside, same era.
2015
Cited alongside, same era.
2016
Later among the works it cites.
Mei, S.; Misiakiewicz, T.; Montanari, A.; Oliveira, R.: Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality, in Proceedings of the 2017 Conference on Learning Theory , Proceedings of Machine Learning Research , vol. 65, edited by S. Kale; O. Shamir, PMLR, Amsterdam, Netherlands, 2017 pp. 1476–1515. Available at: http://proceedings.mlr.press/v65/mei17a.html
2017
Later among the works it cites.
Bhojanapalli, S.; Boumal, N.; Jain, P.; Netrapalli, P.: Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form, in Proceedings of the 31st Conference On Learning Theory , Proceedings of Machine Learning Research , vol. 75, edited by S. Bubeck; V. Perchet; P. Rigollet, PMLR, 2018 pp. 3243–3270. Available at: http://proceedings.mlr.press/v75/bhojanapalli18a.html
2018
Closest in time.
Boumal, N.; Absil, P.-A.; Cartis, C. Global rates of convergence for nonconvex optimization on manifolds. IMA Journal of Numerical Analysis (2018)
2018
Closest in time.
Eriksson, A.; Olsson, C.; Kahl, F.; Chin, T.-J.: Rotation averaging and strong duality, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2018 pp. 127–135
2018
Closest in time.
Pumir, T.; Jelassi, S.; Boumal, N. Smoothed analysis of the low-rank approach for smooth semidefinite programs. in Advances in Neural Information Processing Systems 31 , edited by S. Bengio; H. Wallach; H. Larochelle; K. Grauman; N. Cesa-Bianchi; R. Garnett, pp. 2283–2292, Curran Associates, Inc., 2018
2018
Closest in time.