Advances in Computational Mathematics

, Volume 42, Issue 5, pp 1209–1224 | Cite as

A modified augmented lagrange multiplier algorithm for toeplitz matrix completion

  • Chuanlong WangEmail author
  • Chao Li
  • Jin Wang


In this paper, a modified scheme is proposed for iterative completion matrices generated by the augmented Lagrange multiplier (ALM) method based on the mean value. So that the iterative completion matrices generated by the new algorithm are of the Toeplitz structure, which decrease the computation of SVD and have better approximation to solution. Convergence is discussed. Finally, the numerical experiments and inpainted images show that the new algorithm is more effective than the accelerated proximal gradient (APG) algorithm, the singular value thresholding (SVT) algorithm and the ALM algorithm, in CPU time and accuracy.


Toeplitz matrix Matrix completion Augmented Lagrange multiplier Mean value 

Mathematics Subject Classification (2010)

15A83 15A18 15B05 90C25 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amit, Y., Fink, M., Srebro, N., Ullman, S.: Uncovering shared structures in multiclass classification. In: Processings of the 24th International Conference on Machine Learing, pp 17–24. ACM (2007)Google Scholar
  2. 2.
    Argyriou, A., Evgeniou, T., Pontil, M.: Multi-task feature learing. Adv. Neural Inf. Process. Syst. 19, 41–48 (2007)Google Scholar
  3. 3.
    Bajwa, W.U., Haupt, J.D., Raz, G.M., Wright, S.J., Nowak, R.D.: Toeplitz-structures compressed sensing matrices. Statistical signal Processing, 2007, SSP’07, IEEE/SP 14th Workshop on 294–298 (2007)Google Scholar
  4. 4.
    Bennett, J., Lanning, S.: The netflix prize. In: proceedings of KDD Cup and Workshop (2007)Google Scholar
  5. 5.
    Bertalmio, M., Sapiro, G., Caselles, V., Ballester, C.: Image inpainting. Comput. Grapher, (SIGGRAPH) 2000(34), 417–424 (2000)Google Scholar
  6. 6.
    Cai, J.F., Candès, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956–1982 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Cai, J.F., Osher, S.: Fast singular value thresholding without singular value decomposition. Methods Appl. Anal. 20, 335–352 (2013)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Candès, E.J., Plan, Y.: Matrix completion with noise. In: Proceedings of the IEEE (2009)Google Scholar
  9. 9.
    Candès, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717–772 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Candès, E.J., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inf. Theory 56, 2053–2080 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Del Prete, V., Di Benedetto, F., Donatelli, M., Serra-Capizzano, S.: Symbol approach in a signal-restoration problem involving block Toeplitz matrices, vol. 272 (2014)Google Scholar
  12. 12.
    Fazel, M.: Matrix Rank Minimization with Applications. PhD thesis, Stanford University (2002)Google Scholar
  13. 13.
    Fazel, M., Hindi, H., Boyd, S.P.: Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. In: proceedings of the American Control Conference 3, pp 2156–2162 (2003)Google Scholar
  14. 14.
    Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore, MD (1996)zbMATHGoogle Scholar
  15. 15.
    Gutiérrez-Gutiérrez, J., Crespo, P.M., Böttcher, A.: Functions of banded Hermitian block Toeplitz matrices in signal processing. Linear Algebra Appl. 422, 788–807 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Hale, E.T., Yin, W., Zhang, Y.: Fixed-point continuation for l 1-minimization: methodology and convergence. SIAM J. Optim. 19, 1107–1130 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Hu, Y., Zhang, D.B., Liu, J., Ye, J.P., He, X.F.: Accelerated singular value thresholding for matrix completion. In: KDD’12: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 298–306 (2012)Google Scholar
  18. 18.
    Huang, J, Huang, TZ, Zhao, XL, Xu, Z.B.: Image restoration with shifting reflective boundary conditions. Sci. China Inf. Sci. 56(6), 1–15 (2013)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Kailath, T., Sayed, A. H. (eds.): Fast Reliable Algorithms for Matrices with Structure. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1999)Google Scholar
  20. 20.
    Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans Inf Theory 56, 2980–2998 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Lin, Z., Chen, M., Wu, L., Ma, Y.: The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices UIUC Technicial Report UIUL-ENG-09-2214 (2010)Google Scholar
  22. 22.
    Luk, F.T., Qiao, S.: A Fast Singular Value Algorithm for Hankel Matrices. In: Olshevsky, V. (ed.) Fast Algorithms for Structured Matrices: Theory and Applications, Contemporary Mathematics, Vol. 323, American Mathematical Society (2003)Google Scholar
  23. 23.
    Lv, X.G., Huang, T.Z., Xu, Z.B., Zhao, X.L.: Kronecker product approximations for image restoration with whole-sample symmetric boundary conditions. Inf. Sci. 186, 150C163 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128, 321–353 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Mesbahi, M., Papavassilopoulos, G.P.: On the rank minimization problem over a positive semidefinite linear matrix inequality. IEEE Trans. Autom. Control 42, 239–243 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Recht, B.: A simpler approach to matrix completion. J. Mach. Learing Res. 12, 3413–3430 (2011)MathSciNetzbMATHGoogle Scholar
  27. 27.
    Sebert, F., Zhou, Y.M., Ying, L.: Toeplitz block matrices in compressed sensing and their applications in imaging. In: International Conference on Information Technology and Applications in biomedicine(ITAB), pp 47–50. IEEE (2008)Google Scholar
  28. 28.
    Shaw, A.K., Pokala, S., Kumaresan, R.: Toeplitz and Hankel approximation using structured approach. Acoust., Speech Signal Process., Process. IEEE Int. Conf. 2349, 12–15 (1998)Google Scholar
  29. 29.
    Toh, K.C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac. J. Optim. 6, 615–640 (2010)MathSciNetzbMATHGoogle Scholar
  30. 30.
    Tomasi, C., Kanade, T.: Shape and motion from image streams under orthography: a factorization method. Int. J. Comput. Vis. 9, 137–154 (1992)CrossRefGoogle Scholar
  31. 31.
    Van Loan, C.F.: Computational frameworks for the fast fourier transform society for industrial and applied mathematics (SIAM) (1992)Google Scholar
  32. 32.
    Xu, W., Qiao, S.: A fast SVD algorithm for square Hankel matrices. Linear Algebra Appl. 428, 550–563 (2008)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Higher Education Key Laboratory of Engineering Science Computing in Shanxi ProvinceTaiyuan Normal UniversityTaiyuanChina
  2. 2.School of Computer Science and TechnologyBeihang UniversityBeijingPeople’s Republic of China

Personalised recommendations