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 73
- Downloads 0
Fitting of parameters for a temperature control model by means of continuous derivative-free optimization: a case study in a broiler house
Intensive broiler production requires of accurate control systems aimed to maintain ideal conditions inside the facilities. The achievement of an appropriate environment guarantees good performance and sustainability of...
Complex Neutrosophic Graphs
In this research article, we introduce the notion of complex neutrosophic graphs (cn-graphs, for short) and discuss some basic operations related to cn-graphs. We describe these operations with some examples. We also pr...
Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
To achieve the good features of the linear conjugate gradient algorithm in a recent extension of the Dai-Liao method, two adaptive choices for parameter of the extended method are proposed based on a penalization approac...
Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
We address the issue of approximating the pseudoinverse of the coefficient matrix for dynamically building preconditioning strategies for the numerical solution of large dense linear least-squares problems. The new prec...
A new flexible extension of the generalized half-normal lifetime model with characterizations and regression modeling
In this paper, we introduced a new flexible extension of the Generalized Half-Normal lifetime model as well as a new log-location regression model based on the proposed model. Some useful characterization results are pre...