Iterative algorithm for the symmetric and nonnegative tensor completion problem.

In this paper, we consider the symmetric and nonnegative tensor completion problem. We first reformulate this problem as the minimization problem of the nuclear norm and then design the alternating direction method (ADM) to solve this problem. The -subproblem is treated by the singular value truncation method, and the -subproblem is solved by the nonmonotone spectral projected gradient method. The convergence of ADM method is given. Numerical examples illustrate that the new method is feasible. [ABSTRACT FROM AUTHOR]