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

An Efficient Method for Convex Constrained Rank Minimization Problems Based on DC Programming

School of Economics and Finance, Xi’an Jiaotong University, Xi’an 710061, China

Received 26 January 2016; Revised 19 May 2016; Accepted 2 June 2016

Academic Editor: Srdjan Stankovic

Copyright © 2016 Wanping Yang 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. 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
  2. Y. Amit, M. Fink, N. Srebro, and S. Ullman, “Uncovering shared structures in multiclass classification,” in Proceedings of the 24th International Conference on Machine Learning (ICML '07), pp. 17–24, ACM, Corvallis, Ore, USA, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. L. El Ghaoui and P. Gahinet, “Rank minimization under LMI constraints: a framework for output feedback problems,” in Proceedings of the European Control Conference (ECC '93), Gahinet P. Rank minimization under LMI constraints, Groningen, The Netherlands, June-July 1993.
  4. M. Fazel, H. Hindi, and S. P. Boyd, “A rank minimization heuristic with application to minimum order system approximation,” in Proceedings of the IEEE American Control Conference (ACC '01), vol. 6, pp. 4734–4739, Arlington, Va, USA, June 2001.
  5. M. W. Trosset, “Distance matrix completion by numerical optimization,” Computational Optimization and Applications, vol. 17, no. 1, pp. 11–22, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. 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
  7. L. Wu, “Fast at-the-money calibration of the libor market model through lagrange multipliers,” Journal of Computational Finance, vol. 6, no. 2, pp. 39–77, 2003. View at Google Scholar
  8. Z. Zhang and L. Wu, “Optimal low-rank approximation to a correlation matrix,” Linear Algebra and its Applications, vol. 364, pp. 161–187, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. 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
  10. 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
  11. K. Barman and O. Dabeer, “Analysis of a collaborative filter based on popularity amongst neighbors,” IEEE Transactions on Information Theory, vol. 58, no. 12, pp. 7110–7134, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. S. T. Aditya, O. Dabeer, and B. K. Dey, “A channel coding perspective of collaborative filtering,” IEEE Transactions on Information Theory, vol. 57, no. 4, pp. 2327–2341, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. N. E. Zubov, E. A. Mikrin, M. S. Misrikhanov, V. N. Ryabchenko, S. N. Timakov, and E. A. Cheremnykh, “Identification of the position of an equilibrium attitude of the international space station as a problem of stable matrix completion,” Journal of Computer and Systems Sciences International, vol. 51, no. 2, pp. 291–305, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. T. M. Guerra and L. Vermeiren, “LMI-based relaxed nonquadratic stabilization conditions for nonlinear systems in the Takagi-Sugeno's form,” Automatica, vol. 40, no. 5, pp. 823–829, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. J. Meng, W. Yin, H. Li, E. Hossain, and Z. Han, “Collaborative spectrum sensing from sparse observations in cognitive radio networks,” IEEE Journal on Selected Areas in Communications, vol. 29, no. 2, pp. 327–337, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. Z. Q. Dong, S. Anand, and R. Chandramouli, “Estimation of missing RTTs in computer networks: matrix completion vs compressed sensing,” Computer Networks, vol. 55, no. 15, pp. 3364–3375, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma, “Robust face recognition via sparse representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 2, pp. 210–227, 2009. View at Publisher · View at Google Scholar · View at Scopus
  18. H. Ji, C. Liu, Z. Shen, and Y. Xu, “Robust video denoising using Low rank matrix completion,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '10), pp. 1791–1798, San Francisco, Calif, USA, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. W. U. Bajwa, J. Haupt, A. M. Sayeed, and R. Nowak, “Compressed channel sensing: a new approach to estimating sparse multipath channels,” Proceedings of the IEEE, vol. 98, no. 6, pp. 1058–1076, 2010. View at Publisher · View at Google Scholar · View at Scopus
  20. G. Tauböck, F. Hlawatsch, D. Eiwen, and H. Rauhut, “Compressive estimation of doubly selective channels in multicarrier systems: leakage effects and sparsity-enhancing processing,” IEEE Journal on Selected Topics in Signal Processing, vol. 4, no. 2, pp. 255–271, 2010. View at Publisher · View at Google Scholar · View at Scopus
  21. Y. Tachwali, W. J. Barnes, F. Basma, and H. H. Refai, “The feasibility of a fast fourier sampling technique for wireless microphone detection in IEEE 802.22 air interface,” in Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM '02), pp. 1–5, IEEE, San Diego, Calif, USA, March 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. J. Meng, W. Yin, H. Li, E. Houssain, and Z. Han, “Collaborative spectrum sensing from sparse observations using matrix completion for cognitive radio networks,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '10), pp. 3114–3117, Dallas, Tex, USA, March 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. S. Pudlewski and T. Melodia, “On the performance of compressive video streaming for wireless multimedia sensor networks,” in Proceedings of the IEEE International Conference on Communications (ICC '10), pp. 1–5, IEEE, Cape Town, South Africa, May 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. A. H. Mohseni, M. Babaie-Zadeh, and C. Jutten, “Inflating compressed samples: a joint source-channel coding approach for noise-resistant compressed sensing,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '09), pp. 2957–2960, IEEE, Taipei, Taiwan, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  25. S. J. Benson, Y. Ye, and X. Zhang, “Solving large-scale sparse semidefinite programs for combinatorial optimization,” SIAM Journal on Optimization, vol. 10, no. 2, pp. 443–461, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  26. Z. Lu, Y. Zhang, and X. Li, “Penalty decomposition methods for rank minimization,” Optimization Methods and Software, vol. 30, no. 3, pp. 531–558, 2015. View at Publisher · View at Google Scholar
  27. P. Jain, R. Meka, and I. S. Dhillon, “Guaranteed rank minimization via singular value projection,” in Advances in Neural Information Processing Systems, pp. 937–945, 2010. View at Google Scholar
  28. J. P. Haldar and D. Hernando, “Rank-constrained solutions to linear matrix equations using powerfactorization,” IEEE Signal Processing Letters, vol. 16, no. 7, pp. 584–587, 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2980–2998, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. Y. Nesterov, A. Nemirovskii, and Y. Ye, Interior-Point Polynomial Algorithms in Convex Programming, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 1994.
  31. M. Weimin, Matrix completion models with fixed basis coefficients and rank regularized problems with hard constraints [Ph.D. thesis], National University of Singapore, 2013.
  32. M. Fazel, Matrix rank minimization with applications [Ph.D. thesis], Stanford University, 2002.
  33. K. M. Grigoriadis and E. B. Beran, “Alternating projection algorithms for linear matrix inequalities problems with rank constraints,” in Advances in Linear Matrix Inequality Methods in Control, pp. 512–267, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 1999. View at Google Scholar
  34. Y. Gao and D. Sun, “A majorized penalty approach for calibrating rank constrained correlation matrix problems,” 2010, http://www.math.nus.edu.sg/~matsundf/MajorPen.pdf.
  35. S. Burer, R. D. C. Monteiro, and Y. Zhang, “Maximum stable set formulations and heuristics based on continuous optimization,” Mathematical Programming, vol. 94, no. 1, pp. 137–166, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. R. Bhatia, Matrix Analysis, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  37. Z. Lu, “Sequential convex programming methods for a class of structured nonlinear programming,” https://arxiv.org/abs/1210.3039.
  38. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  39. 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 MathSciNet · View at Scopus
  40. http://www.stanford.edu/~yyye/yyye/Gset/.
  41. C. Helmberg and F. Rendl, “A spectral bundle method for semidefinite programming,” SIAM Journal on Optimization, vol. 10, no. 3, pp. 673–696, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  42. M. X. Goemans and D. P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” Journal of ACM, vol. 42, no. 6, pp. 1115–1145, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  43. G. A. Kochenberger, J.-K. Hao, Z. Lü, H. Wang, and F. Glover, “Solving large scale max cut problems via tabu search,” Journal of Heuristics, vol. 19, no. 4, pp. 565–571, 2013. View at Publisher · View at Google Scholar · View at Scopus
  44. G. Palubeckis and V. Krivickiene, “Application of multistart tabu search to the max-cut problem,” Information Technology and Control, vol. 31, no. 2, pp. 29–35, 2004. View at Google Scholar