A. S. Abbe, G. Bandeira, and . Hall, Exact recovery in the stochastic block model, Transactions on Information Theory, vol.62, issue.1, pp.471-487, 2016.

P. Absil, R. Mahony, and R. Sepulchre, Optimization algorithms on matrix manifolds, 2009.

A. S. Bandeira, N. Boumal, and V. Voroninski, On the low-rank approach for semidefinite programs arising in synchronization and community detection, Proceedings of the Conference on Computational Learning Theory, 2016.

A. S. Bandeira, C. Kennedy, and A. Singer, Approximating the little grothendieck problem over the orthogonal and unitary groups, Mathematical programming, vol.160, issue.1-2, pp.433-475, 2016.

S. Bhojanapalli, N. Boumal, P. Jain, and P. Netrapalli, Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form, Proceedings of the 31st Conference On Learning Theory, pp.3243-3270, 2018.

N. , A riemannian low-rank method for optimization over semidefinite matrices with blockdiagonal constraints, 2015.

N. Boumal, P. Absil, and C. Cartis, Global rates of convergence for nonconvex optimization on manifolds, IMA Journal of Numerical Analysis, 2016.

N. Boumal, V. Voroninski, and A. S. Bandeira, Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs, 2018.

S. Burer and R. D. Monteiro, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Mathematical Programming, vol.95, issue.2, pp.329-357, 2003.

S. Burer and R. D. Monteiro, Local minima and convergence in low-rank semidefinite programming, Mathematical Programming, vol.103, issue.3, pp.427-444, 2005.

M. R. Celis, A trust region strategy for nonlinear equality constrained optimization, 1985.

K. N. Chaudhury, Y. Khoo, and A. Singer, Global registration of multiple point clouds using semidefinite programming, SIAM Journal on Optimization, vol.25, issue.1, pp.468-501, 2015.

M. Cucuringu, Sync-rank: Robust ranking, constrained ranking and rank aggregation via eigenvector and SDP synchronization, IEEE Transactions on Network Science and Engineering, vol.3, issue.1, pp.58-79, 2016.

M. Cucuringu, Y. Lipman, and A. Singer, Sensor network localization by eigenvector synchronization over the euclidean group, ACM Transactions on Sensor Networks (TOSN), vol.8, issue.3, 2012.

C. Delorme and S. Poljak, Laplacian eigenvalues and the maximum cut problem, Mathematical Programming, vol.62, issue.3, pp.557-574, 1993.

A. Eriksson, C. Olsson, F. Kahl, and T. Chin, Rotation averaging and strong duality, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.127-135, 2018.

R. Ge, J. D. Lee, and T. Ma, Matrix completion has no spurious local minimum, to appear in Advances in Neural Information Processing Systems, vol.29, 2016.

M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM, vol.42, issue.6, pp.1115-1145, 1995.

M. Jaggi, Revisiting Frank-Wolfe: Projection-free sparse convex optimization, Proceedings of the 30th International Conference on Machine Learning, pp.427-435, 2013.

M. Journée, F. Bach, P. Absil, and R. Sepulchre, Low-rank optimization on the cone of positive semidefinite matrices, SIAM Journal on Optimization, vol.20, issue.5, pp.2327-2351, 2010.

S. Laue, A hybrid algorithm for convex semidefinite optimization, Proceedings of the 29th International Conference on Machine Learning, pp.177-184, 2012.

Q. Li, Z. Zhu, and G. Tang, The non-convex geometry of low-rank matrix optimization. Information and Inference: A, Journal of the IMA, 2018.

S. Mei, T. Misiakiewicz, A. Montanari, and R. I. Oliveira, Solving SDPs for synchronization and maxcut problems via the grothendieck inequality, 2017.

B. Mishra, G. Meyer, S. Bonnabel, and R. Sepulchre, Fixed-rank matrix factorizations and riemannian low-rank optimization, Computational Statistics, vol.29, issue.3-4, pp.591-621, 2014.

G. Pataki, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues, Mathematics of operations research, vol.23, issue.2, pp.339-358, 1998.

S. Poljak and F. Rendl, Nonpolyhedral relaxations of graph-bisection problems, SIAM Journal on Optimization, vol.5, issue.3, pp.467-487, 1995.

T. Pumir, S. Jelassi, and N. Boumal, Smoothed analysis of the low-rank approach for smooth semidefinite programs, Advances in Neural Information Processing Systems, 2018.

D. M. Rosen, L. Carlone, A. S. Bandeira, and J. J. Leonard, Se-sync: A certifiably correct algorithm for synchronization over the special euclidean group, International journal of robotics research, 2016.

J. Sun, Q. Qu, and J. Wright, A geometric analysis of phase retrieval, Foundations of Computational Mathematics, 2017.

I. Waldspurger, A. .-d'aspremont, and S. Mallat, Phase recovery, maxcut and complex semidefinite programming, Mathematical Programming, pp.47-81, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00907535

L. Wang, A. Singer, and Z. Wen, Orientation determination of cryo-em images using least unsquared deviations, SIAM journal on imaging sciences, vol.6, issue.4, pp.2450-2483, 2013.

A. Yurtsever, M. Udell, J. A. Tropp, and V. Cevher, Sketchy decisions: convex low-rank matrix optimization with optimal storage, Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, vol.54, pp.1188-1196, 2017.