Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm

zbMATH Open1398.65082MaRDI QIDQ1653941FDOQ1653941

Authors: Harry Oviedo, Jinjun Yuan, Hugo J. Lara 

Publication date: 7 August 2018

Published in: Bulletin of Computational Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://drive.google.com/open?id=0B5GyVVQ6O030bEVPb3owckh5YVE

Recommendations

• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• An ADMM-factorization algorithm for low rank matrix completion
• Low rank matrix completion by alternating direction method of multipliers
• Matrix Completion Based on Non-Convex Low-Rank Approximation
• Low-rank matrix completion using alternating minimization
• Matrix Completion under Low-Rank Missing Mechanism
• Matrix completion via minimizing an approximate rank
• Low-rank matrix completion in a general non-orthogonal basis
• A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion
• An efficient method for non-negative low-rank completion

zbMATH Keywords

matrix completionaugmented Lagrange methodnonlinear Gauss-Seidel methodalternanting minimizationnonlinear SOR method

Mathematics Subject Classification ID

Matrix completion problems (15A83) Iterative numerical methods for linear systems (65F10)

Cites Work

• Practical Augmented Lagrangian Methods for Constrained Optimization
• Title not available (Why is that?)
• Exact matrix completion via convex optimization
• Title not available (Why is that?)
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Eigentaste: A constant time collaborative filtering algorithm

Cited In (6)

• A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Matrix completion via an alternating direction method
• Approximate matrix completion based on cavity method
• Implicit steepest descent algorithm for optimization with orthogonality constraints
• Global convergence of Riemannian line search methods with a Zhang-Hager-type condition

Uses Software

• ALGENCAN
• Eigentaste

This page was built for publication: Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653941)