Fast Optimization Algorithm on Riemannian Manifolds and Its Application in Low-Rank Representation

12/07/2015
by   Haoran Chen, et al.
0

The paper addresses the problem of optimizing a class of composite functions on Riemannian manifolds and a new first order optimization algorithm (FOA) with a fast convergence rate is proposed. Through the theoretical analysis for FOA, it has been proved that the algorithm has quadratic convergence. The experiments in the matrix completion task show that FOA has better performance than other first order optimization methods on Riemannian manifolds. A fast subspace pursuit method based on FOA is proposed to solve the low-rank representation model based on augmented Lagrange method on the low rank matrix variety. Experimental results on synthetic and real data sets are presented to demonstrate that both FOA and SP-RPRG(ALM) can achieve superior performance in terms of faster convergence and higher accuracy.

READ FULL TEXT

page 15

page 16

page 17

research
08/18/2020

Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method

Robust low-rank matrix completion (RMC), or robust principal component a...
research
10/26/2018

Communication Efficient Parallel Algorithms for Optimization on Manifolds

The last decade has witnessed an explosion in the development of models,...
research
08/23/2013

Manopt, a Matlab toolbox for optimization on manifolds

Optimization on manifolds is a rapidly developing branch of nonlinear op...
research
11/17/2020

Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order Convergence

In this paper, we propose a new ecursive mportance ketching algorithm fo...
research
03/27/2021

Automatic differentiation for Riemannian optimization on low-rank matrix and tensor-train manifolds

In scientific computing and machine learning applications, matrices and ...
research
11/03/2017

Background Subtraction via Fast Robust Matrix Completion

Background subtraction is the primary task of the majority of video insp...
research
02/02/2017

Solving Uncalibrated Photometric Stereo Using Fewer Images by Jointly Optimizing Low-rank Matrix Completion and Integrability

We introduce a new, integrated approach to uncalibrated photometric ster...

Please sign up or login with your details

Forgot password? Click here to reset