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
Linear programming model for solution of matrix game with payoffs trapezoidal intuitionistic fuzzy number
In this work, we considered two-person zero-sum games with fuzzy payoffs and matrix games with payoffs of trapezoidal intuitionistic fuzzy numbers (TrIFNs). The concepts of TrIFNs and their arithmetic operations were use...
A convex optimization approach for solving large scale linear systems
The well-known Conjugate Gradient (CG) method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this wo...
Algebraic structures in generalized Clifford analysis and applications to boundary value problems
The present article has a threefold purpose: First it is a survey of the algebraic structures of generalized Clifford-type algebras and shows the main results of the corresponding Clifford-type analysis and its applicati...
(Free) Software for general partial differential equation problems in non-rectangular 2D and 3D regions
PDE2D is a general-purpose partial differential equation solver which solves very general systems of nonlinear, steady-state, time-dependent and eigenvalue PDEs in 1D intervals, general 2D regions (see Figure 1), and a w...
A deterministic optimization approach for solving the rainfall disaggregation problem
One of the main problems in hydrology is the time scale of the historical rainfall data, available from many meteorological data bases. Most of the rainfall data is given at a time scale coarser than the one needed for...