Alternating Least-Squares for Low-Rank Matrix Reconstruction
  For reconstruction of low-rank matrices from undersampled measurements, we develop an iterative algorithm based on least-squares estimation. While the algorithm can be used for any low-rank matrix, it is also capable of exploiting a-priori knowledge of matrix structure. In particular, we consider linearly structured matrices, such as Hankel and Toeplitz, as well as positive semidefinite matrices. The performance of the algorithm, referred to as alternating least-squares (ALS), is evaluated by simulations and compared to the Cram\'er-Rao bounds. 
Dave Zachariah, Martin Sundin, Magnus Jansson and Saikat Chatterjee
math.ST stat.TH