This paper builds on our own previous work [29] wherewe extended the matrix trace norm to the tensor case andproposed to recover the missing entries in a low rank tensorby solving a tensor trace norm minimization problem. Weused a relaxation trick on the objective function such thatthe block coordinate descent algorithm can be employed tosolve this problem [29]. Since this approach is not efficientenough, some recent papers tried to use the alternatingdirection method of multipliers to efficiently solve thetensor trace norm minimization problem.