An adaptation for iterative structured matrix completion

DOI10.3934/fods.2021028zbMath1483.65066arXiv2002.02041OpenAlexW3212514852WikidataQ114574833 ScholiaQ114574833MaRDI QIDQ2072669

Deanna Needell, Lara Kassab, Henry Adams

Publication date: 26 January 2022

Published in: Foundations of Data Science (Search for Journal in Brave)

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

zbMATH Keywords

sparse matriceslow-rank matrix completiongradient-projection methodsiteratively reweighted algorithmsstructured matrix completion

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Uses Software

• CVX
• GitHub
• ADMiRA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Main effects and interactions in mixed and incomplete data frames
• Convergence of fixed-point continuation algorithms for matrix rank minimization
• Fixed point and Bregman iterative methods for matrix rank minimization
• Theory of semidefinite programming for sensor network localization
• The geometry of graphs and some of its algorithmic applications
• Imputation and low-rank estimation with missing not at random data
• Exact matrix completion via convex optimization
• Completing Any Low-rank Matrix, Provably
• Robust principal component analysis?
• Uncertainty Principles and Signal Recovery
• Graph Implementations for Nonsmooth Convex Programs
• A Singular Value Thresholding Algorithm for Matrix Completion
• A remark on global positioning from local distances
• Rank-Sparsity Incoherence for Matrix Decomposition
• Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
• Decoding by Linear Programming
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Iteratively reweighted least squares minimization for sparse recovery
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• ADMiRA: Atomic Decomposition for Minimum Rank Approximation
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Weighted low rank approximations with provable guarantees
• A Simpler Approach to Matrix Completion
• Low-rank matrix completion using alternating minimization