Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm

Toplitz matrix completion (TMC) is to fill a low-rank Toeplitz matrix from a small subset of its entries. Based on the augmented Lagrange multiplier (ALM) algorithm for matrix completion, in this paper, we propose a new algorithm for the TMC problem using the smoothing technique of the approximation matrices. The completion matrices generated by the new algorithm are of Toeplitz structure throughout iteration, which save computational cost of the singular value decomposition (SVD) and approximate well the solution. Convergence results of the new algorithm are proved. Finally, the numerical experiments show that the augmented Lagrange multiplier algorithm with smoothing is more effective than the original ALM and the accelerated proximal gradient (APG) algorithms. (C) 2019 Elsevier Inc. All rights reserved.