Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Optspace / rank | |||
Normal rank | |||
Revision as of 09:08, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm |
scientific article |
Statements
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (English)
0 references
10 April 2013
0 references
The matrix completion problem is to recover a low-rank matrix from a subset of its entries. The authors propose a low-rank factorization model and construct a nonlinear succesive over-relaxation algorithm that only requires solving a linear least squares problem per iteration. Numerical experiments show that the algorithm can reliable solve a wide range of problems.
0 references
matrix completion
0 references
alternating minimization
0 references
nonlinear GS method
0 references
nonlinear SOR method
0 references
low-rank factorization model
0 references
nonlinear succesive over-relaxation algorithm
0 references
linear least squares problem
0 references
numerical experiments
0 references
