Painless breakups -- efficient demixing of low rank matrices

DOI10.1007/s00041-017-9564-4zbMath1428.15017arXiv1703.09848OpenAlexW2604615309MaRDI QIDQ1710648

Thomas Strohmer, Ke Wei

Publication date: 23 January 2019

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

random matricesnonconvex optimizationiterative hard thresholdingquantum tomographyrestricted isometry propertylow rank matrices

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Nonconvex programming, global optimization (90C26) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29) Approximation with constraints (41A29) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items

Exact matrix completion based on low rank Hankel structure in the Fourier domain, Hierarchical compressed sensing

Uses Software

• PhaseLift

Cites Work

• Unnamed Item
• A time domain algorithm for blind separation of convolutive sound mixtures and \(L_1\) constrained minimization of cross correlations
• Computing a nearest symmetric positive semidefinite matrix
• Exact matrix completion via convex optimization
• Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Low-Rank Matrix Completion by Riemannian Optimization
• Normalized Iterative Hard Thresholding for Matrix Completion
• Blind Deconvolution Using Convex Programming
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Image decomposition via the combination of sparse representations and a variational approach
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Blind Separation of Quantum States: Estimating Two Qubits from an Isotropic Heisenberg Spin Coupling Model
• Interior Methods for Nonlinear Optimization
• Compressive principal component pursuit
• Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
• Blind Image Deconvolution
• Hadamard matrices and their applications