Skip to main content
eScholarship
Open Access Publications from the University of California

Painless Breakups -- Efficient Demixing of Low Rank Matrices

  • Author(s): Strohmer, Thomas
  • Wei, Ke
  • et al.

Published Web Location

https://arxiv.org/pdf/1703.09848.pdf
No data is associated with this publication.
Abstract

Assume we are given a sum of linear measurements of s different rank-r matrices of the form y=∑sk=1Ak(Xk). When and under which conditions is it possible to extract (demix) the individual matrices Xk from the single measurement vector y? And can we do the demixing numerically efficiently? We present two computationally efficient algorithms based on hard thresholding to solve this low rank demixing problem. We prove that under suitable conditions these algorithms are guaranteed to converge to the correct solution at a linear rate. We discuss applications in connection with quantum tomography and the Internet-of-Things. Numerical simulations demonstrate empirically the performance of the proposed algorithms.

Item not freely available? Link broken?
Report a problem accessing this item