Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 656074, 8 pages
http://dx.doi.org/10.1155/2014/656074
Research Article

A Generalized Robust Minimization Framework for Low-Rank Matrix Recovery

1College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
2School of Mathematics and Statistics, Nanjing Audit University, Nanjing 211815, China
3School of Computer Science and Communication, KTH Royal Institute of Technology, Stockholm 10044, Sweden

Received 18 January 2014; Accepted 23 April 2014; Published 6 May 2014

Academic Editor: Carlo Cattani

Copyright © 2014 Wen-Ze Shao et al. 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. J. Wright, Y. Peng, Y. Ma, A. Ganesh, and S. Rao, “Robust principal component analysis: exact recovery of corrupted low-rank matrices by convex optimization,” in Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS '09), pp. 2080–2088, December 2009. View at Scopus
  2. E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?” Journal of the ACM, vol. 58, no. 3, article 11, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  3. Z. Lin, M. Chen, Y. Ma et al., “The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices,” http://arxiv.org/abs/1009.5055.
  4. Z. Lin, A. Ganesh, J. Wright et al., “Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix,” in Proceedings of the International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, Aruba, Dutch Antilles, 2009.
  5. 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 Zentralblatt MATH · View at MathSciNet
  6. X. Yuan and J. Yang, “Sparse and low rank matrix decomposition via alternating direction method,” Pacific Journal of Optimization, vol. 9, no. 1, pp. 167–180, 2013. View at Google Scholar · View at Zentralblatt MATH
  7. S. Wang, D. Liu, and Z. Zhang, “Nonconvex relaxation approaches to robust matrix recovery,” pp. 1764–1770, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, 2013.
  8. M. Fazel, H. Hindi, and S. P. Boyd, “Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices,” in Proceedings of the IEEE American Control Conference, vol. 3, pp. 2156–2162, June 2003. View at Scopus
  9. A. Kyrillidis and V. Cevher, “Matrix ALPS: accelerated low rank and sparse matrix reconstruction,” in Proceedings of IEEE Statistical Signal Processing Workshop, pp. 185–188, 2012.
  10. P. L. Combettes and J.-C. Pesquet, “Proximal splitting methods in signal processing,” in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185–212, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Athena Scientific, 1996.
  12. J. von Neumann, “Some matrix-inequalities and metrization of matric-space,” Reviews of Tomsk Polytechnic University, vol. 1, pp. 286–300, 1937. View at Google Scholar · View at Zentralblatt MATH
  13. D. Krishnan and R. Fergus, “Fast image deconvolution using hyper-laplacian priors,” in Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS '09), pp. 1033–1041, December 2009. View at Scopus
  14. A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences, vol. 2, no. 1, pp. 183–202, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. 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 Zentralblatt MATH · View at MathSciNet
  16. C. Qiu and N. Vaswani, “ReProCS: a missing link between recursive robust PCA and recursive sparse recovery in large but correlated noise,” http://arxiv.org/abs/1106.3286.
  17. T. Zhou and D. Tao, “GoDec: randomized low-rank & sparse matrix decomposition in noisy case,” in Proceedings of the 28th International Conference on Machine Learning (ICML '11), pp. 33–40, Bellevue, Wash, USA, July 2011. View at Scopus
  18. C. Hage and M. Kleinsteuber, “Robust PCA and subspace tracking from incomplete observations using L0-surrogates,” Computational Statistics, 2013. View at Publisher · View at Google Scholar
  19. D. Kong, M. Zhang, and C. Ding, “Minimal shrinkage for noisy data recovery using Schatten-p norm objective,” in Machine Learning and Knowledge Discovery in Databases, pp. 177–193, Springer, Berlin, Germany, 2013. View at Google Scholar