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 65
- Downloads 0
Transitivity of parametric family of cardinality-based fuzzy similarity measures using Lukasiewicz t-norm
In fuzzy logic, where members of a set might be linguistic terms, the degree of reflexivity might be in unit interval [0,1] instead of {0,1}. This behaviour of a fuzzy set plays an important role especially in the field...
New results on the stability, integrability and boundedness in Volterra integro-differential equations
The authors of this article deal with a first order non-linear Volterra integro-differential equation (NVIDE). To this end, the conditions are obtained which are sufficient for stability (S), boundedness (B), and for eve...
Redox reactions as experimental examples of ternary weak algebraic hyperstructures
A ternary hyperoperation on a set H is a 3-ary hyperoperation, which associates a subset of H with any three elements of H. In this paper, we give examples of ternary hyperoperations associated with redox reactions. We...
Fundamentals of soft category theory
The soft category theory offers a way to study soft theories developed so far more generally. The main purpose of this paper is to introduce the basic algebraic operations in soft categories, and for that we introduce so...
Integrating Fuzzy Formal Concept Analysis and Rough Set Theory for the Semantic Web
Formal Concept Analysis and Rough Set Theory provide two mathematical frameworks in information management which have been developed almost independently in the past. Currently, their integration is revealing very intere...