GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery (Q5089733): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 09:45, 30 July 2024

scientific article; zbMATH DE number 7556890

Language	Label	Description	Also known as
English	GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery	scientific article; zbMATH DE number 7556890

Statements

scholarly article

0 references

GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery (English)

0 references

0 references

0 references

SIAM Journal on Mathematics of Data Science

0 references

publication date

15 July 2022

0 references

full work available at URL

https://arxiv.org/abs/2106.12933

0 references

zbMATH Keywords

low rank matrices

0 references

matrix completion

0 references

matrix sensing

0 references

matrix recovery

0 references

Gauss-Newton

0 references

MaRDI profile type

MaRDI publication profile

0 references

Trust-region methods on Riemannian manifolds

0 references

0 references

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

0 references

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

The restricted isometry property and its implications for compressed sensing

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence

0 references

Nonconvex Rectangular Matrix Completion via Gradient Descent Without <i>ℓ</i>₂,<sub>∞</sub> Regularization

0 references

Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization

0 references

Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis

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

0 references

Low-rank matrix completion using alternating minimization

0 references

Matrix Completion From a Few Entries

0 references

0 references

Matrix recipes for hard thresholding methods

0 references

Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization

0 references

Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent

0 references

Beyond Procrustes: Balancing-Free Gradient Descent for Asymmetric Low-Rank Matrix Sensing

0 references

Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution

0 references

Fixed point and Bregman iterative methods for matrix rank minimization

0 references

On $l_q$ Optimization and Matrix Completion

0 references

0 references

Low-Rank Optimization with Trace Norm Penalty

0 references

Fixed-rank matrix factorizations and Riemannian low-rank optimization

0 references

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

0 references

Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably

0 references

A Simpler Approach to Matrix Completion

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

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

0 references

0 references

Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number

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

0 references

On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition

0 references

Global Optimality in Low-Rank Matrix Optimization

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/21M1433812

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5089733

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5089733&oldid=37141768"