Half thresholding eigenvalue algorithm for semidefinite matrix completion

Science China Mathematics

Volumn 58, Issue 9, 2015, Pages 2015-2032

  Chen, YongQiang ^a,b   Luo, ZiYan ^a   Xiu, NaiHua ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b HENAN NORMAL UNIVERSITY   (China)

Author keywords

convergence; half thresholding eigenvalue algorithm; S1 2 relaxation; semidefinite matrix completion

Indexed keywords

EID: 84939253542     PISSN: 16747283     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11425-015-5052-y     Document Type: Article

References (24)

1. Chen C H, He B S, Yuan X M. Matrix completion via an alternating direction method. IMA J Numer Anal, 2012, 32: 227–245
2. Chen X J, Xu F M, Ye Y Y. Lower bound theory of nonzero entries in solutions of l2-lp minimization. SIAM J Sci Comput, 2010, 32: 2832–2852
3. Ding C. An introduction to a class of matrix optimization problems. PhD thesis. Singapore: National University of Singapore, 2012
4. Drusvyatskiy D, Pataki G, Wolkowicz H, et al. Coordinate shadows of semidefinite and Euclidean distance matrices. Preprint, 2014, http://www.optimization-online.org/DB FILE/2014/05/4349.pdf
5. Horn R, Johnson C. Matrix Analysis. New York: Cambridge University Press, 1990
6. Huang Z H, Hu S L, Han J Y. Convergence of a smoothing algorithm for symmetric cone complementarity problemswith a nonmonotone line search. Sci China Ser A, 2009, 52: 833–848
7. Ji S, Sze K F, Zhou Z, et al. Beyond convex relaxation: A polynomial-time non-convex optimization approach tonetwork localization. In: 2013 Proceedings IEEE INFOCOM, vol. 12. Turin: IEEE, 2013, 2499–2507
8. Krislock N, Wolkowicz H. Euclidean distance matrices and applications. In: Anjos M, Lasserre J, eds. Handbook of Semidefinite, Conic and Polynomial Optimization. New York: Springer, 2012, 879–914
9. Laurent M, Varvitsiotis A. Positive semidefinite matrix completion, universal rigidity and the strong Arnold property. Http://www.optimization-online.org/DB HTML/2013/02/3776.html
10. *(k)-LCP over symmetric cones. SciChina Ser A, 2009, 52: 1769–1784
11. Ma S Q. Alternating direction method of multipliers for sparse principal component analysis. J Oper Res Soc China, 2013, 1: 253–274
12. Miao WM. Matrix completion models with fixed basis coefficients and rank regularized problems with hard constraints. PhD thesis. Singapore: National University of Singapore, 2013
13. Qi H D. Conditional quadratic semidefinite programming: examples and methods. J Oper Res Soc China, 2014, 2: 143–170
14. Qi H D, Xiu N H, Yuan X M. A Lagrangian dual approach to the single source localization problem. IEEE Trans Signal Process, 2013, 61: 3815–3826
15. Rakotomamonjy A, Flamary R, Gasso G, et al. Lp-Lq penalty for sparse linear and sparse multiple kernel multitask learning. IEEE Trans Neural Networks, 2011, 22: 1307–1320
16. Rao G, Peng Y, Xu Z B. Robust sparse and low-rank matrix fraction based on S1/2 modeling (in Chinese). Sci ChinaInform Sci, 2013, 43: 733–748
17. Salakhutdinov R, Srebro N. Collaborative filtering in a non-uniform world: Learning with the weighted trace norm.In: Lafferty J D, Williams C K I, Shawe-Taylor J, et al, eds. Advances in Neural Information Processing Systems, vol.23. New York: Curran Associates, 2010, 2056–2064
18. Tian Y J, Ju X C, Qi Z Q, et al. Improved twin support vector machine. Sci China Math, 2014, 57: 417–432
19. Toh K C, Yun S W. An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac J Optim, 2010, 6: 615–640
20. Wolkowicz H, Saigal R, Vandenberghe L. Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Boston: Kluwer Academic Publishers, 2000
21. 1/2 regularization: A thresholding representation theory and a fast solver. IEEET rans Neural Networks Learn Syst, 2012, 23: 1013–1027
22. q (0 < q ≤ 1) regularizer: An experimentalstudy based on phase diagram. Acta Automat Sin, 2012, 38: 1225–1228
23. Zhang Y. Theory of compressive sensing via l1-minimization: A non-RIP analysis and extensions. J Oper Res Soc China, 2014, 2: 39–56
24. Zheng X Y. Error bounds for set inclusions. Sci China Ser A, 2003, 46: 750–763