Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2016, Article ID 1659019, 5 pages
http://dx.doi.org/10.1155/2016/1659019
Research Article

A New Algorithm for Positive Semidefinite Matrix Completion

College of Mathematics and Systems Science, Shandong University of Science and Technology, Qingdao 266590, China

Received 29 June 2016; Accepted 22 September 2016

Academic Editor: Qing-Wen Wang

Copyright © 2016 Fangfang Xu and Peng Pan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. E. J. Candés and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics, vol. 9, no. 6, pp. 717–772, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review, vol. 52, no. 3, pp. 471–501, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. H. Ji, C. Liu, Z. Shen, and Y. Xu, “Robust video denoising using Low rank matrix completion,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '10), pp. 1791–1798, IEEE, San Francisco, Calif, USA, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. J.-F. Cai, E. J. Candés, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization, vol. 20, no. 4, pp. 1956–1982, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. S. Ma, D. Goldfarb, and L. Chen, “Fixed point and Bregman iterative methods for matrix rank minimization,” Mathematical Programming, vol. 128, no. 1-2, pp. 321–353, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. K.-C. Toh and S. Yun, “An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems,” Pacific Journal of Optimization, vol. 6, no. 3, pp. 615–640, 2010. View at Google Scholar · View at MathSciNet
  7. Z. Wen, W. Yin, and Y. Zhang, “Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm,” Mathematical Programming Computation, vol. 4, no. 4, pp. 333–361, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. M. Fazel, Matrix rank minimization with application [Ph.D. thesis], Stanford University, Stanford, Calif, USA, 2002.
  9. D. Goldfarb, S. Ma, and Z. Wen, “Solving low-rank matrix completion problems efficiently,” in Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton '09), pp. 1013–1020, Monticello, Ill, USA, September 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. E. J. Candés and T. Tao, “The power of convex relaxation: near-optimal matrix completion,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2053–2080, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. C. Chen, B. He, and X. Yuan, “Matrix completion via an alternating direction method,” IMA Journal of Numerical Analysis, vol. 32, no. 1, pp. 227–245, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. M. Fortin and R. Glowinski, “Augmented Lagrangian methods,” in Applications to the Numerical Solution of Boundary Value Problems, Studies in Mathematics and its Applications, North-Holland, Amsterdam, The Netherlands, 1983, Translated from the French by B. Hunt and D. C. Spicer. View at Google Scholar
  13. B. S. He, H. Yang, and S. L. Wang, “Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities,” Journal of Optimization Theory and Applications, vol. 106, no. 2, pp. 337–356, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. Z. Wen, D. Goldfarb, and W. Yin, “Alternating direction augmented Lagrangian methods for semidefinite programming,” Mathematical Programming Computation, vol. 2, no. 3-4, pp. 203–230, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. W. Deng and W. Yin, “On the global and linear convergence of the generalized alternating direction method of multipliers,” Tech. Rep., Rice University CAAM, 2012. View at Google Scholar
  16. Y. Xu, W. Yin, Z. Wen, and Y. Zhang, “An alternating direction algorithm for matrix completion with nonnegative factors,” Frontiers of Mathematics in China, vol. 7, no. 2, pp. 365–384, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. F. Xu and G. He, “New algorithms for nonnegative matrix completion,” Pacific Journal of Optimization, vol. 11, no. 3, pp. 459–469, 2015. View at Google Scholar · View at MathSciNet
  18. L. M. Briceño-Arias and P. L. Combettes, “A monotone+skew splitting model for composite monotone inclusions in duality,” SIAM Journal on Optimization, vol. 21, no. 4, pp. 1230–1250, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. R. Glowinski and P. Le Tallec, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics, vol. 9 of SIAM Studies in Applied Mathematics, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  20. B. He and X. Yuan, “Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming,” Numerical Algebra, Control and Optimization, vol. 3, no. 2, pp. 247–260, 2013. View at Publisher · View at Google Scholar