Matrix completion via a low rank factorization model and an Augmented Lagrangean Succesive Overrelaxation Algorithm
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2014, Vol 2, Issue 2
Abstract
The matrix completion problem (MC) has been approximated by using the nuclear norm relaxation. Some algorithms based on this strategy require the computationally expensive singular value decomposition (SVD) at each iteration. One way to avoid SVD calculations is to use alternating methods, which pursue the completion through matrix factorization with a low rank condition. In this work an augmented Lagrangean-type alternating algorithm is proposed. The new algorithm uses duality information to define the iterations, in contrast to the solely primal LMaFit algorithm, which employs a Successive Over Relaxation scheme. The convergence result is studied. Some numerical experiments are given to compare numerical performance of both proposals.
Authors and Affiliations
Hugo Lara, Harry Oviedo, Jinjun Yuan
Keywords
Related Articles
- EP ID EP245119
- DOI -
- Views 82
- Downloads 0
Modeling seismic wave propagation using staggered-grid mimetic finite differences
Mimetic finite difference (MFD) approximations of continuous gradient and divergence operators satisfy a discrete version of the Gauss-Divergence theorem on staggered grids. On the mimetic approximation of this integral...
Some Convergence Strategies for the Alternating Generalized Projection Method
In this paper we extend the application of the alternating projection algorithm to solve the problem of finding a point in the intersection of $n$ sets ($n\geq2$), which are not all of them convex sets. Here we term such...
L(2,1)-Labeling for Subdivisions of Cycle Dominated Graphs
Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of non-negative integers such that |f(x)-f(y)| &ge...
Matrix completion via a low rank factorization model and an Augmented Lagrangean Succesive Overrelaxation Algorithm
The matrix completion problem (MC) has been approximated by using the nuclear norm relaxation. Some algorithms based on this strategy require the computationally expensive singular value decomposition (SVD) at each iter...
The exponential distribution as the sum of discontinuous distributions
We show that for any natural number $n$, an exponential distribution can be written as the sum of $n$ discontinuous variables and another exponential distribution, all of them independent.