Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries

Pini Zilber, Boaz Nadler, Jonathan Bauch

Publication date: 6 July 2021

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.01849

zbMATH Keywords

matrix completion low rank low rank matrices R2RILS algorithm

Mathematics Subject Classification ID

Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items

GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery ⋮ Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence

Uses Software

LSQR
softImpute
Jellyfish
RTRMC
CRAIG

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Fixed point and Bregman iterative methods for matrix rank minimization
On the Wiberg algorithm for matrix factorization in the presence of missing components
Low rank matrix completion by alternating steepest descent methods
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
Matrix recipes for hard thresholding methods
Fixed-rank matrix factorizations and Riemannian low-rank optimization
Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
Parallel stochastic gradient algorithms for large-scale matrix completion
Exact matrix completion via convex optimization
Completing Any Low-rank Matrix, Provably
Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
Low-Rank Matrix Completion by Riemannian Optimization
Normalized Iterative Hard Thresholding for Matrix Completion
Guaranteed Matrix Completion via Non-Convex Factorization
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
A Singular Value Thresholding Algorithm for Matrix Completion
Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
On $l_q$ Optimization and Matrix Completion
CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
Inference and uncertainty quantification for noisy matrix completion
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
Matrix Completion From a Few Entries
The Power of Convex Relaxation: Near-Optimal Matrix Completion
A Simpler Approach to Matrix Completion
Low-rank matrix completion using alternating minimization

This page was built for publication: Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries