{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:12:25Z","timestamp":1777871545866,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T00:00:00Z","timestamp":1541980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11301021"],"award-info":[{"award-number":["11301021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11075-018-0630-z","type":"journal-article","created":{"date-parts":[[2018,11,11]],"date-time":"2018-11-11T19:54:09Z","timestamp":1541966049000},"page":"371-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization"],"prefix":"10.1007","volume":"82","author":[{"given":"Jianxi","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lina","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,12]]},"reference":[{"key":"630_CR1","unstructured":"Wright, J., Ganesh, A., Rao, S., Peng, Y., Ma, Y.: Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. Adv. Neural Inf. Process. Syst., 2080\u20132088 (2009)"},{"key":"630_CR2","doi-asserted-by":"publisher","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, 11 (2011)","journal-title":"J. ACM."},{"key":"630_CR3","doi-asserted-by":"crossref","unstructured":"Min, K., Zhang, Z., Wright, J., Ma, Y.: Decomposing background topics from keywords by principal component pursuit. In: Proceedings of the 19th ACM International Conference, pp. 269\u2013278 (2010)","DOI":"10.1145\/1871437.1871475"},{"key":"630_CR4","unstructured":"Bennett, J., Lanning, S.: The netflix prize. In: Proceedings of KDD Cup and Workshop, p. 35 (2007)"},{"key":"630_CR5","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parril, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"630_CR6","doi-asserted-by":"publisher","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, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"630_CR7","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE. T. Inform. Theory 51, 4203\u20134215 (2005)","journal-title":"IEEE. T. Inform. Theory"},{"key":"630_CR8","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: For most large underdetermined systems of linear equations the minimal l\n                           1-norm solution is also the sparsest solution. Commun. Pur. Appl. Math. 59, 797\u2013829 (2006)","journal-title":"Commun. Pur. Appl. Math."},{"key":"630_CR9","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 J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"630_CR10","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/090755436","volume":"31","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Vandenberghe, L.: Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix. Anal. A 31, 1235\u20131256 (2009)","journal-title":"SIAM J. Matrix. Anal. A"},{"key":"630_CR11","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TAP.1986.1143830","volume":"34","author":"R Schmidt","year":"1986","unstructured":"Schmidt, R.: Multiple emitter location and signal parameter estimation. IEEE. T. Antenn. Propag. 34, 276\u2013280 (1986)","journal-title":"IEEE. T. Antenn. Propag."},{"key":"630_CR12","doi-asserted-by":"crossref","unstructured":"Ji, H., Liu, C., Shen, Z., Xu, Y.: Robust video denoising using low-rank matrix completion. In: Proceedings of IEEE Conference (2010)","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"630_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, X., Xiong, H.: Illumination compensation via low rank matrix completion for multiview video coding. In: 2013 IEEE International Conference, pp. 1865\u20131869 (2013)","DOI":"10.1109\/ICIP.2013.6738384"},{"key":"630_CR14","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optimiz. 21, 572\u2013596 (2011)","journal-title":"SIAM J. Optimiz."},{"key":"630_CR15","doi-asserted-by":"crossref","unstructured":"Lin, Z., Ganesh, A., Wright, J., Wu, L., Chen, M., Ma, Y.: Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix. Comput. Adv. Multi-Sensor Adapt. Process., 61 (2009)","DOI":"10.1109\/CAMSAP.2009.5413299"},{"key":"630_CR16","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. Math. Program. 128, 321\u2013353 (2011)","journal-title":"Math. Program."},{"key":"630_CR17","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/S0097539704442696","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices II: computing a low-rank approximation to a matrix. SIAM J. Comput. 36, 158\u2013183 (2006)","journal-title":"SIAM J. Comput."},{"key":"630_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging. Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging. Sci."},{"key":"630_CR19","first-page":"15","volume":"6","author":"KC 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, 15 (2010)","journal-title":"Pac. J. Optim."},{"key":"630_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10915-013-9815-8","volume":"61","author":"YH Xiao","year":"2014","unstructured":"Xiao, Y.H., Wu, S.Y., Qi, L.: Nonmonotone Barzilai-Borwein gradient algorithm for l\n                           1-regularized nonsmooth minimization in compressive sensing. J. Sci. Comput. 61, 17\u201341 (2014)","journal-title":"J. Sci. Comput."},{"key":"630_CR21","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/imanum\/drq039","volume":"32","author":"C Chen","year":"2012","unstructured":"Chen, C., He, B., Yuan, X.: Matrix completion via an alternating direction method. IMA J. Numer. Anal. 32, 227\u2013245 (2012)","journal-title":"IMA J. Numer. Anal."},{"key":"630_CR22","unstructured":"Hiriart-Urruty, J.B., Lemarechal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals. Springer Science & Business Media (2013)"},{"key":"630_CR23","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: A Fixed-point Continuation Method for l\n                           1-regularized Minimization with Applications to Compressed Sensing. Rice University, pp. 43\u201344 (2007)"},{"key":"630_CR24","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"630_CR25","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1002\/nla.783","volume":"19","author":"YH Xiao","year":"2012","unstructured":"Xiao, Y.H., Jin, Z.: An alternating direction method for linear-constrained matrix nuclear norm minimization. Numer. Linear. Algebr. 19, 541\u2013554 (2012)","journal-title":"Numer. Linear. Algebr."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0630-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-018-0630-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0630-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T19:09:31Z","timestamp":1573499371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-018-0630-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,12]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["630"],"URL":"https:\/\/doi.org\/10.1007\/s11075-018-0630-z","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,12]]},"assertion":[{"value":"3 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}