{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:07:02Z","timestamp":1761646022991},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40991-2_14","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T05:43:57Z","timestamp":1377668637000},"page":"210-225","source":"Crossref","is-referenced-by-count":14,"title":["A Nearly Unbiased Matrix Completion Approach"],"prefix":"10.1007","author":[{"given":"Dehua","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tengfei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Congfu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E.J. Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Foundations of Computational Mathematics\u00a09(6), 717\u2013772 (2009)","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"14_CR2","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E.J. Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory\u00a056(5), 2053\u20132080 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"14_CR3","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"R. Keshavan","year":"2010","unstructured":"Keshavan, R., Montanari, A., Sewoong, O.: Matrix Completion from a Few Entries. IEEE Transactions on Information Theory\u00a056(6), 2980\u20132998 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J. Cai","year":"2010","unstructured":"Cai, J., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization\u00a020(4), 1956\u20131982 (2010)","journal-title":"SIAM Journal on Optimization"},{"key":"14_CR5","first-page":"2287","volume":"99","author":"R. Mazumder","year":"2010","unstructured":"Mazumder, R., Hastie, T., Tibshirani, R.: Spectral Regularization Algorithms for Learning Large Incomplete Matrices. The Journal of Machine Learning Research\u00a099, 2287\u20132322 (2010)","journal-title":"The Journal of Machine Learning Research"},{"issue":"1-2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S. Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Mathematical Programming\u00a0128(1-2), 321\u2013353 (2011)","journal-title":"Mathematical Programming"},{"key":"14_CR7","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: A fixed-point continuation method for \u21131-regularized minimization with applications to compressed sensing. echnical Report, CAAM TR07-07 (2007)"},{"key":"14_CR8","first-page":"1009","volume":"arXiv","author":"Z. Lin","year":"2010","unstructured":"Lin, Z., Chen, M., Wu, L., Ma, Y.: The augmented Lagrange multiplier method for Exact Recovery of Corrupted Low-Rank Matrices. arXiv preprint arXiv:1009.5055 (2010)","journal-title":"arXiv preprint"},{"key":"14_CR9","unstructured":"Lin, Z., Liu, R., Su, Z.: Linearized alternating direction method with adaptive penalty for low-rank representation. In: Advances in Neural Information Processing Systems (2011)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Hu, Y., Zhang, D., Liu, J., Ye, J., He, X.: Accelerated singular value thresholding for matrix completion. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2012)","DOI":"10.1145\/2339530.2339581"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B. Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review\u00a052(3), 471\u2013501 (2010)","journal-title":"SIAM Review"},{"key":"14_CR12","first-page":"1303","volume":"arXiv","author":"T.T. Cai","year":"2013","unstructured":"Cai, T.T., Zhou, W.: Matrix completion via max-norm constrained optimization. arXiv preprint arXiv:1303.0341 (2013)","journal-title":"arXiv preprint"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Nie, F., Wang, H., Cai, X., Huang, H., Ding, C.: Robust Matrix Completion via Joint Schatten p-Norm and \u2113\n                    p\n                  -Norm Minimization. In: 2012 IEEE 12th International Conference on Data Mining (ICDM), pp. 566\u2013574 (2012)","DOI":"10.1109\/ICDM.2012.160"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Hu, Y., Zhang, D., Ye, J., Li, X., He, X.: Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization. EEE Transactions on Pattern Analysis and Machine Intelligence (2012)","DOI":"10.1109\/TPAMI.2012.271"},{"key":"14_CR15","unstructured":"Wang, S., Liu, D., Zhang, Z.: Nonconvex Relaxation Approaches to Robust Matrix Recovery. In: International Joint Conference on Artificial Intelligence (2013)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Mazumder, R., Friedman, J.H., Hastie, T.: SparseNet: Coordinate descent with nonconvex penalties. Journal of the American Statistical Association\u00a0106(495) (2011)","DOI":"10.1198\/jasa.2011.tm09738"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C.H. Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly Unbiased Variable Selection Under Minimax Concave Penalty. The Annals of Statistics\u00a038(2), 894\u2013942 (2010)","journal-title":"The Annals of Statistics"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D. Gabay","year":"1976","unstructured":"Gabay, D., Bertrand, M.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Computers & Mathematics with Applications\u00a02(1), 1\u201340 (1976)","journal-title":"Computers & Mathematics with Applications"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S. Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning\u00a03(1), 1\u2013122 (2011)","journal-title":"Foundations and Trends in Machine Learning"},{"key":"14_CR20","unstructured":"Xiang, S., Shen, X., Ye, J.: Efficient Sparse Group Feature Selection via Nonconvex Optimization. arXiv preprint arXiv:1205.5075 (2012)"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11228-004-7197-7","volume":"13","author":"A.S. Lewis","year":"2005","unstructured":"Lewis, A.S., Hristo, S.S.: Nonsmooth analysis of singular values. Part I: Theory. Set-Valued Analysis\u00a013(3), 213\u2013241 (2005)","journal-title":"Part I: Theory. Set-Valued Analysis"},{"issue":"4","key":"14_CR22","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/S0895479895283173","volume":"17","author":"A.S. Lewis","year":"1996","unstructured":"Lewis, A.S.: Group invariance and convex matrix analysis. SIAM Journal on Matrix Analysis and Applications\u00a017(4), 927\u2013949 (1996)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"14_CR23","unstructured":"Salakhutdinov, R., Mnih, A.: Probabilistic matrix factorization. In: Advances in Neural Information Processing Systems, pp. 1257\u20131264 (2008)"},{"key":"14_CR24","unstructured":"Shalev-Shwartz, S., Gonen, A., Shamir, O.: Large-scale convex minimization with a low-rank constraint. In: International Conference on Machine Learning (2011)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40991-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T23:49:02Z","timestamp":1558050542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40991-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40991-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}