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
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:20, 5 March 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
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references