Manopt, a matlab toolbox for optimization on manifolds

Journal of Machine Learning Research

Volumn 15, Issue , 2014, Pages 1455-1459

  Boumal, Nicolas ^a   Mishra, Bamdev ^a   Absil, P A ^b   Sepulchre, Rodolphe ^c  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIVERSITY OF LIÈGE   (Belgium)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Non convex; Nonlinear programming; Optimization with symmetries; Orthogonality constraints; Rank constraints; Riemannian optimization; Rotation matrices

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; GEOMETRY; INDEPENDENT COMPONENT ANALYSIS; NONLINEAR PROGRAMMING; OPTIMIZATION; SENSOR NETWORKS;

NON CONVEX; ORTHOGONALITY CONSTRAINTS; RANK CONSTRAINTS; RIEMANNIAN OPTIMIZATIONS; ROTATION MATRICES;

MATLAB;

EID: 84901625709     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. P.-A. Absil and K.A. Gallivan. Joint diagonalization on the oblique manifold for independent component analysis. In Acoustics, Speech and Signal Processing, ICASSP 2006. IEEE International Conference on, volume 5, 2006. doi: 10.1109/ICASSP.2006.1661433.
2. P.-A. Absil, C. G. Baker, and K. A. Gallivan. Trust-region methods on Riemannian mani-folds. Foundations of Computational Mathematics, 7(3):303-330, July 2007.
3. P.-A. Absil, R. Mahony, and R. Sepulchre. Optimization Algorithms on Matrix Manifolds. Princeton University Press, 2008.
4. N. Boumal and P.-A. Absil. RTRMC: A Riemannian trust-region method for low-rank matrix completion. In J. Shawe-Taylor et al., editors, Advances in Neural Information Processing Systems 24 (NIPS), pages 406-414. 2011.
5. N. Boumal, A. Singer, and P.-A. Absil. Robust estimation of rotations from relative mea-surements by maximum likelihood. Proceedings of the 52nd Conference on Decision and Control, CDC 2013, 2013.
6. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM), 42(6):1115-1145, 1995.
7. I. Grubifisific and R. Pietersz. Effcient rank reduction of correlation matrices. Linear algebra and its applications, 422(2):629-653, 2007. (Pubitemid 46329688)
8. M. Journfiee, F. Bach, P.-A. Absil, and R. Sepulchre. Low-rank optimization on the cone of positive semidefinite matrices. SIAM Journal on Optimization, 20(5):2327-2351, 2010a.
9. M. Journfiee, Y. Nesterov, P. Richtfiarik, and R. Sepulchre. Generalized power method for sparse principal component analysis. The Journal of Machine Learning Research, 11: 517-553, 2010b.
10. R.H. Keshavan, A. Montanari, and S. Oh. Matrix completion from noisy entries. The Journal of Machine Learning Research, 99:2057-2078, 2010.
11. G. Meyer, S. Bonnabel, and R. Sepulchre. Regression onffxed-rank positive semidefinite matrices: a Riemannian approach. The Journal of Machine Learning Research, 12:593-625, 2011.
12. B. Mishra, G. Meyer, and R. Sepulchre. Low-rank optimization for distance matrix com-pletion. In Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on, pages 4455-4460. IEEE, 2011.
13. B. Mishra, G. Meyer, S. Bonnabel, and R. Sepulchre. Fixed-rank matrix factorizations and Riemannian low-rank optimization. Arxiv preprint arXiv:1209.0430, 2012.
14. U. Shalit, D. Weinshall, and G. Chechik. Online learning in the embedded manifold of low-rank matrices. The Journal of Machine Learning Research, 13:429-458, 2012.
15. F.J. Theis, T.P. Cason, and P.-A. Absil. Soft dimension reduction for ICA by joint di-agonalization on the Stiefel manifold. In Independent Component Analysis and Signal Separation, pages 354-361. Springer, 2009.
16. B. Vandereycken. Low-rank matrix completion by Riemannian optimization. SIAM Journal on Optimization, 23(2):1214-1236, 2013. doi: 10.1137/110845768.