arXiv (Cornell University) · 2013 · 803 citations · 13 references
ComputingComputer ScienceAlgorithmsMachine LearningOptimizationConstrained OptimizationConvex OptimizationDimensionality ReductionMetric LearningOptimization For Machine LearningRiemannian GeometryIndependent Component AnalysisLow-rank OptimizationManifold LearningMatrix CompletionNonlinear OptimizationOptimization AlgorithmsSensor Network LocalizationSmooth Optimization
Optimization on manifolds is a rapidly developing branch of nonlinear optimization. Its focus is on problems where the smooth geometry of the search space can be leveraged to design efficient numerical algorithms. In particular, optimization on manifolds is well-suited to deal with rank and orthogonality constraints. Such structured constraints appear pervasively in machine learning applications, including low-rank matrix completion, sensor network localization, camera network registration, independent component analysis, metric learning, dimensionality reduction and so on. The Manopt toolbox, available at www.manopt.org, is a user-friendly, documented piece of software dedicated to simplify experimenting with state of the art Riemannian optimization algorithms. We aim particularly at reaching practitioners outside our field.
13
Low-Rank Matrix Completion by Riemannian Optimization
Bart Vandereycken · SIAM Journal on Optimization · 2013 · 520 citations · Full text
Generalized power method for sparse principal component analysis
Michel Journée, Yurii Nesterov, Peter Richtárik et al. · ArXiv.org · 2008 · 501 citations · Full text
Computing, Data Science, Data Mining +16
Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
Michel Journée, Francis Bach, Pierre-Antoine Absil et al. · SIAM Journal on Optimization · 2010 · 220 citations · Full text