{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T04:37:12Z","timestamp":1772339832094,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,21]],"date-time":"2015-05-21T00:00:00Z","timestamp":1432166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91230108"],"award-info":[{"award-number":["91230108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471253"],"award-info":[{"award-number":["11471253"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71471140"],"award-info":[{"award-number":["71471140"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10915-015-0045-0","type":"journal-article","created":{"date-parts":[[2015,5,20]],"date-time":"2015-05-20T16:26:00Z","timestamp":1432139160000},"page":"849-869","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["An Alternating Direction Method with Continuation for Nonconvex Low Rank Minimization"],"prefix":"10.1007","volume":"66","author":[{"given":"Zheng-Fen","family":"Jin","sequence":"first","affiliation":[]},{"given":"Zhongping","family":"Wan","sequence":"additional","affiliation":[]},{"given":"Yuling","family":"Jiao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7592-5994","authenticated-orcid":false,"given":"Xiliang","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,21]]},"reference":[{"key":"45_CR1","unstructured":"Srebro, N.: Learning with matrix factorizations. Doctoral dissertation, Massachusetts Institute of Technology (2004)"},{"issue":"2","key":"45_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1011419012209","volume":"4","author":"K Goldberg","year":"2001","unstructured":"Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: a constant time collaborative filtering algorithm. Inf. Retr. 4(2), 133\u2013151 (2001)","journal-title":"Inf. Retr."},{"issue":"12","key":"45_CR3","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.1091\/mbc.9.12.3273","volume":"9","author":"PT Spellman","year":"1998","unstructured":"Spellman, P.T., Sherlock, G., Zhang, M.Q., Iyer, V.R., Anders, K., Eisen, M.B., Brown, P.O., Botstein, D., Futcher, B.: Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization. Mol. Biol. Cell 9(12), 3273\u20133297 (1998)","journal-title":"Mol. Biol. Cell"},{"key":"45_CR4","unstructured":"Netfix prize website http:\/\/www.netflixprize.com"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Mohan, K., Fazel, M.: Reweighted nuclear norm minimization with application to system identification. In: American Control Conference, 2010, pp. 2953\u20132959. IEEE (2010)","DOI":"10.1109\/ACC.2010.5531594"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.: Rank minimization and applications in system theory. In: American Control Conference, 2004. Proceedings of the 2004, vol. 4, pp. 3273\u20133278. IEEE (2004)","DOI":"10.23919\/ACC.2004.1384521"},{"issue":"3","key":"45_CR7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 11 (2011)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"45_CR8","doi-asserted-by":"crossref","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. Math. Program. 128(1\u20132), 321\u2013353 (2011)","journal-title":"Math. Program."},{"issue":"6","key":"45_CR9","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"5","key":"45_CR10","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"45_CR11","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56(6), 2980\u20132998 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"45_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.-C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using sdpt3. Math. Program. 95(2), 189\u2013217 (2003)","journal-title":"Math. Program."},{"issue":"4","key":"45_CR13","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"45_CR14","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10107-010-0437-8","volume":"133","author":"Y-J Liu","year":"2012","unstructured":"Liu, Y.-J., Sun, D., Toh, K.-C.: An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. 133(1\u20132), 399\u2013436 (2012)","journal-title":"Math. Program."},{"issue":"615\u2013640","key":"45_CR15","first-page":"15","volume":"6","author":"K-C Toh","year":"2010","unstructured":"Toh, K.-C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 6(615\u2013640), 15 (2010)","journal-title":"Pac. J. Optim."},{"issue":"3","key":"45_CR16","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1002\/nla.783","volume":"19","author":"Y-H Xiao","year":"2012","unstructured":"Xiao, Y.-H., Jin, Z.-F.: An alternating direction method for linear-constrained matrix nuclear norm minimization. Numer. Linear Algebra Appl. 19(3), 541\u2013554 (2012)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"281","key":"45_CR17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"J Yang","year":"2013","unstructured":"Yang, J., Yuan, X.: Linearized augmented lagrangian and alternating direction methods for nuclear norm minimization. Math. Comput. 82(281), 301\u2013329 (2013)","journal-title":"Math. Comput."},{"issue":"3","key":"45_CR18","doi-asserted-by":"crossref","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 Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"9","key":"45_CR19","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2013","unstructured":"Hu, Y., Zhang, D., Ye, J., Li, X., He, X.: Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2117\u20132130 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"45_CR20","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen, X., Fengmin, X., Ye, Y.: Lower bound theory of nonzero entries in solutions of $$l_2-l_p$$ l 2 - l p minimization. SIAM J. Sci. Comput. 32(5), 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"45_CR21","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11, 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"456","key":"45_CR22","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"45_CR23","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"45_CR24","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.cam.2013.12.005","volume":"263","author":"Y-F Li","year":"2014","unstructured":"Li, Y.-F., Zhang, Y.-J., Huang, Z.-H.: A reweighted nuclear norm minimization algorithm for low rank matrix recovery. J. Comput. Appl. Math. 263, 338\u2013350 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"Lu, C., Tang, J., Yan, S., Lin, Z.: Generalized nonconvex nonsmooth low-rank minimization. arXiv preprint arXiv:1404.7306 (2014)","DOI":"10.1109\/CVPR.2014.526"},{"issue":"2","key":"45_CR26","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"M-J Lai","year":"2013","unstructured":"Lai, M.-J., Yangyang, X., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$l_q$$ l q minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"45_CR27","unstructured":"Wang, S., Liu, D., Zhang, Z.: Nonconvex relaxation approaches to robust matrix recovery. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 1764\u20131770. AAAI Press (2013)"},{"key":"45_CR28","unstructured":"Jiao, Y., Jin, B., Lu, X.: A primal dual active set algorithm for a class of nonconvex sparsity optimization. arXiv preprint. arXiv:1310.1147 (2013)"},{"issue":"1","key":"45_CR29","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., Zhang, Y.: Alternating direction algorithms for l\\_1-problems in compressive sensing. SIAM J. Sci. Comput. 33(1), 250\u2013278 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"45_CR30","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10589-012-9475-x","volume":"54","author":"Y Xiao","year":"2013","unstructured":"Xiao, Y., Zhu, H., Soon-Yi, W.: Primal and dual alternating direction algorithms for $$l_1-l_1$$ l 1 - l 1 -norm minimization problems in compressive sensing. Comput. Optim. Appl. 54(2), 441\u2013459 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"45_CR31","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10915-011-9507-1","volume":"51","author":"X Yuan","year":"2012","unstructured":"Yuan, X.: Alternating direction method for covariance selection models. J. Sci. Comput. 51(2), 261\u2013273 (2012)","journal-title":"J. Sci. Comput."},{"key":"45_CR32","doi-asserted-by":"crossref","first-page":"6276","DOI":"10.1109\/TSP.2014.2362880","volume":"62","author":"Q Fan","year":"2014","unstructured":"Fan, Q., Jiao, Y., Lu, X.: A primal dual active set algorithm with continuation for compressed sensing. IEEE Trans. Signal Process. 62, 6276\u20136285 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"45_CR33","doi-asserted-by":"crossref","unstructured":"Jiao, Y., Jin, B., Lu, X.: A primal dual active set with continuation algorithm for the $$\\ell ^0$$ \u2113 0 -regularized optimization problem. Appl. Comput. Harmon. Anal. (2014). doi: 10.1016\/j.acha.2014.10.001","DOI":"10.1016\/j.acha.2014.10.001"},{"issue":"1","key":"45_CR34","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L.: Atomic decomposition by basis pursuit. SIAM J Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J Sci. Comput."},{"issue":"1","key":"45_CR35","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodological) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodological)"},{"issue":"6","key":"45_CR36","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"Akaike, H.: A new look at the statistical model identification. IEEE Trans. Autom. Control 19(6), 716\u2013723 (1974)","journal-title":"IEEE Trans. Autom. Control"},{"key":"45_CR37","unstructured":"Lu, Z., Zhang, Y.: Penalty decomposition methods for rank minimization. Research Paper, Department of Mathematics, Simon Fraser University. Available at http:\/\/people.math.sfu.ca\/zhaosong\/ResearchPapers\/pd-rank-rev.pdf (2013)"},{"key":"45_CR38","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.cam.2013.07.009","volume":"256","author":"Z-F Jin","year":"2014","unstructured":"Jin, Z.-F., Wang, Q., Wan, Z.: Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm. J. Comput. Appl. Math. 256, 114\u2013120 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"45_CR39","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970944","volume-title":"Iterative Methods for Linear and Nonlinear Equations","author":"CT Kelley","year":"1995","unstructured":"Kelley, C.T.: Iterative Methods for Linear and Nonlinear Equations. Society for Industrial and Applied Mathematics, Philadelphia (1995)"},{"issue":"11","key":"45_CR40","doi-asserted-by":"crossref","first-page":"115010","DOI":"10.1088\/0266-5611\/28\/11\/115010","volume":"28","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yang, C., Liu, X., Marchesini, S.: Alternating direction methods for classical and ptychographic phase retrieval. Inverse Probl. 28(11), 115010 (2012)","journal-title":"Inverse Probl."},{"key":"45_CR41","doi-asserted-by":"crossref","unstructured":"Wen, Z., Peng, X., Liu, X., Sun, X., Bai, X.: Asset allocation under the basel accord risk measures. arXiv preprint, arXiv:1308.1321 (2013)","DOI":"10.2139\/ssrn.2202845"},{"issue":"2","key":"45_CR42","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/10556788.2012.700713","volume":"29","author":"Y Shen","year":"2014","unstructured":"Shen, Y., Wen, Z., Zhang, Y.: Augmented lagrangian alternating direction method for matrix separation based on low-rank factorization. Optim. Methods Softw. 29(2), 239\u2013263 (2014)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"45_CR43","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/TSP.2013.2295557","volume":"62","author":"M Malek-Mohammadi","year":"2014","unstructured":"Malek-Mohammadi, M., Babaie-Zadeh, M., Amini, A., Jutten, C.: Recovery of low-rank matrices under affine constraints via a smoothed rank function. IEEE Trans. Signal Process. 62(4), 981\u2013992 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"45_CR44","unstructured":"Larsen, R.M.: Propack-software for large and sparse svd calculations. Available online, http:\/\/sun.stanford.edu\/rmunk\/PROPACK (2004)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-015-0045-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-015-0045-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-015-0045-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T03:51:53Z","timestamp":1717905113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-015-0045-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,21]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["45"],"URL":"https:\/\/doi.org\/10.1007\/s10915-015-0045-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,21]]}}}