Fast smooth rank approximation for tensor completion

  title={Fast smooth rank approximation for tensor completion},
  author={Mohammed Al-Qizwini and Hayder Radha},
  journal={2014 48th Annual Conference on Information Sciences and Systems (CISS)},
In this paper we consider the problem of recovering an N-dimensional data from a subset of its observed entries. We provide a generalization for the smooth Shcatten-p rank approximation function in [1] to the N-dimensional space. In addition, we derive an optimization algorithm using the Augmented Lagrangian Multiplier in the N-dimensional space to solve the tensor completion problem. We compare the performance of our algorithm to state-of-the-art tensor completion algorithms using different… CONTINUE READING