Low-rank matrix completion in a general non-orthogonal basis

DOI10.1016/j.laa.2021.05.001zbMath1470.15023arXiv1812.05786OpenAlexW3157639225MaRDI QIDQ2032243

Abiy Tasissa, Rongjie Lai

Publication date: 11 June 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionrestricted isometry propertynuclear norm minimizationdual basisoperator Chernoff bounds

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Uses Software

• PhaseLift

Cites Work

• Sensor network localization, Euclidean distance matrix completions, and graph realization
• User-friendly tail bounds for sums of random matrices
• Characterization of the subdifferential of some matrix norms
• Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
• RIPless compressed sensing from anisotropic measurements
• Exact matrix completion via convex optimization
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems
• Robust Spectral Compressed Sensing via Structured Matrix Completion
• Compressive Sampling Using Annihilating Filter-Based Low-Rank Interpolation
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Unified Theory for Recovery of Sparse Signals in a General Transform Domain
• Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion
• A Probabilistic and RIPless Theory of Compressed Sensing
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance
• A Simpler Approach to Matrix Completion
• An Introduction to Matrix Concentration Inequalities
• Phase Retrieval via Matrix Completion
• Compressed sensing

This page was built for publication: Low-rank matrix completion in a general non-orthogonal basis