Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries (Q4999366): Difference between revisions

Latest revision as of 03:23, 26 July 2024

scientific article; zbMATH DE number 7368795

Language	Label	Description	Also known as
English	Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries	scientific article; zbMATH DE number 7368795

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

SIAM Journal on Mathematics of Data Science

0 references

publication date

6 July 2021

0 references

full work available at URL

https://arxiv.org/abs/2002.01849

0 references

zbMATH Keywords

low rank

0 references

low rank matrices

0 references

matrix completion

0 references

R2RILS algorithm

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion

0 references

Low-rank matrix completion via preconditioned optimization on the Grassmann manifold

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Completing Any Low-rank Matrix, Provably

0 references

Inference and uncertainty quantification for noisy matrix completion

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

Q2760174

0 references

Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Low-rank matrix completion using alternating minimization

0 references

Matrix Completion From a Few Entries

0 references

Q4558196

0 references

Matrix recipes for hard thresholding methods

0 references

Fixed point and Bregman iterative methods for matrix rank minimization

0 references

On $l_q$ Optimization and Matrix Completion

0 references

Q2896145

0 references

Fixed-rank matrix factorizations and Riemannian low-rank optimization

0 references

On the Wiberg algorithm for matrix factorization in the presence of missing components

0 references

LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

0 references

A Simpler Approach to Matrix Completion

0 references

Parallel stochastic gradient algorithms for large-scale matrix completion

0 references

Uniqueness of Low-Rank Matrix Completion by Rigidity Theory

0 references

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

Normalized Iterative Hard Thresholding for Matrix Completion

0 references

Low rank matrix completion by alternating steepest descent methods

0 references

Q3161693

0 references

Low-Rank Matrix Completion by Riemannian Optimization

0 references

Guarantees of Riemannian Optimization for Low Rank Matrix Recovery

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

Q4166064

0 references

Identifiers

DOI

10.1137/20M1315294

0 references

Mathematics Subject Classification ID

65F55

0 references

zbMATH DE Number

7368795

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4999366

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