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

DOI10.1137/20M1315294MaRDI QIDQ4999366zbMATH OpenFDO

Authors Jonathan Bauch, Boaz Nadler, Pini Zilber

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 completionlow ranklow rank matricesR2RILS algorithm

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3599325 (Why is no real title available?)
• A Singular Value Thresholding Algorithm for Matrix Completion
• A simpler approach to matrix completion
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• Completing any low-rank matrix, provably
• Exact matrix completion via convex optimization
• Fixed point and Bregman iterative methods for matrix rank minimization
• Fixed-rank matrix factorizations and Riemannian low-rank optimization
• Guaranteed Matrix Completion via Non-Convex Factorization
• Guarantees of Riemannian optimization for low rank matrix recovery
• Harmonic mean iteratively reweighted least squares for low-rank matrix recovery
• Inference and uncertainty quantification for noisy matrix completion
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Local operator theory, random matrices and Banach spaces.
• Low rank matrix completion by alternating steepest descent methods
• Low-rank matrix completion by Riemannian optimization
• Low-rank matrix completion using alternating minimization
• Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
• Low-rank matrix recovery via iteratively reweighted least squares minimization
• Matrix Completion From a Few Entries
• Matrix recipes for hard thresholding methods
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Normalized iterative hard thresholding for matrix completion
• On $l_q$ Optimization and Matrix Completion
• On the Wiberg algorithm for matrix factorization in the presence of missing components
• Parallel stochastic gradient algorithms for large-scale matrix completion
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Spectral regularization algorithms for learning large incomplete matrices
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Uniqueness of low-rank matrix completion by rigidity theory

Cited in

(3)

• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
• GNMR: a provable one-line algorithm for low rank matrix recovery
• Rank $2r$ iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries

Describes a project that uses

Uses Software

• CRAIG
• RTRMC
• Jellyfish
• softImpute
• LSQR

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

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