A gradual rank increasing process for matrix completion

DOI10.1007/S11075-017-0292-2MaRDI QIDQ1689449zbMATH OpenOpenAlexFDO

Authors Achiya Dax

Publication date 12 January 2018

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-017-0292-2

zbMATH Keywords

missing dataalternating least squarescross-validationnumerical experimentsmatrix completion problemstraining setrank determinationerror assessmentgradual rank increasingimputingprobe set

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• A gradient system for low rank matrix completion
• Matrix completion via minimizing an approximate rank
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• A rank-corrected procedure for matrix completion with fixed basis coefficients
• Exact matrix completion via convex optimization

Cites work

• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 3687182 (Why is no real title available?)
• scientific article; zbMATH DE number 3540601 (Why is no real title available?)
• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• scientific article; zbMATH DE number 1226426 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
• Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data
• How many principal components? Stopping rules for determining the number of non-trivial axes revisited
• Iteration Methods for Nonlinear Problems
• Low-rank matrix completion using alternating minimization
• Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights
• Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
• Relaxation Methods for Convex Problems

Cited in

(5)

• Typical and generic ranks in matrix completion
• A two-phase rank-based algorithm for low-rank matrix completion
• Rank estimation in missing data matrix problems
• A gradient system for low rank matrix completion
• Homotopy method for matrix rank minimization based on the matrix hard thresholding method

This page was built for publication: A gradual rank increasing process for matrix completion

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