{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:00:26Z","timestamp":1772298026200,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T00:00:00Z","timestamp":1487203200000},"content-version":"unspecified","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":["11401124"],"award-info":[{"award-number":["11401124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10589-017-9898-5","type":"journal-article","created":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T14:40:05Z","timestamp":1487256005000},"page":"543-569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["$$S_{1\/2}$$ S 1 \/ 2 regularization methods and fixed point algorithms for affine rank minimization problems"],"prefix":"10.1007","volume":"67","author":[{"given":"Dingtao","family":"Peng","sequence":"first","affiliation":[]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"9898_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"P-A Absil","year":"2007","unstructured":"Absil, P.-A., Baker, C., Gallivan, K.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7, 303\u2013330 (2007)","journal-title":"Found. Comput. Math."},{"key":"9898_CR2","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1137\/120864908","volume":"23","author":"W Bian","year":"2013","unstructured":"Bian, W., Chen, X.: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization. SIAM J. Optim. 23, 1718\u20131741 (2013)","journal-title":"SIAM J. Optim."},{"key":"9898_CR3","unstructured":"Boumal, N., Absil, P.: RTRMC: A riemannian trust-region method for low-rank matrix completion, In: NIPS (2011)"},{"key":"9898_CR4","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J Cai","year":"2010","unstructured":"Cai, J., Cand\u00e8s, E., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"9898_CR5","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"E Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E., Plan, Y.: Matrix completion with noise. Proc IEEE 98, 925\u2013936 (2010)","journal-title":"Proc IEEE"},{"key":"9898_CR6","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"9898_CR7","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9898_CR8","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56, 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9898_CR9","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstructions of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14, 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"key":"9898_CR10","first-page":"293","volume":"I","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Nonconvex regularization for shape preservation. IEEE Int. Conf. Image Process. I, 293\u2013296 (2007)","journal-title":"IEEE Int. Conf. Image Process."},{"key":"9898_CR11","doi-asserted-by":"crossref","unstructured":"Chartrand, R.: Fast algorithms for nonconvex compressive sensing: MRI reconstruction from very few data. In: Proceedings of IEEE International Symposium on Biomedical Imaging, pp. 262\u2013265 (2009)","DOI":"10.1109\/ISBI.2009.5193034"},{"key":"9898_CR12","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1088\/0266-5611\/24\/3\/035020","volume":"24","author":"R Chartrand","year":"2008","unstructured":"Chartrand, R., Staneva, V.: Restricted isometry properties and nonconvex compressive sensing. Inverse Probl. 24, 20\u201335 (2008)","journal-title":"Inverse Probl."},{"key":"9898_CR13","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"X Chen","year":"2014","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of unconstrained $$\\ell _2$$ \u2113 2 - $$\\ell _p$$ \u2113 p minimization. Math. Program. Ser. A 143, 371\u2013383 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"9898_CR14","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen, X., Xu, F., Ye, Y.: Lower bound theory of nonzero entries in solutions of $$\\ell _2-\\ell _p$$ \u2113 2 - \u2113 p minimization. SIAM J. Sci. Comput. 32, 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"9898_CR15","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE Trans. Inf. Theory 52, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9898_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-012-0619-7","volume":"144","author":"C Ding","year":"2014","unstructured":"Ding, C., Sun, D., Toh, K.-C.: An introduction to a class of matrix cone programming. Math. Program. Ser. A 144, 141\u2013179 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"9898_CR17","doi-asserted-by":"crossref","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 low-rank approximations to a matrix. SIAM J. Comput. 36, 158\u2013183 (2006)","journal-title":"SIAM J. Comput."},{"key":"9898_CR18","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I.M., Tibshirani, R.: Least angle regression. Ann. Stat. 32, 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"key":"9898_CR19","unstructured":"Fazel, M.: Matrix rank minimization with applications. PhD thesis, Stanford University, (2002)"},{"key":"9898_CR20","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of American Control Conference (2001)","DOI":"10.1109\/ACC.2001.945730"},{"key":"9898_CR21","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H. , Boyd, S.: Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. In: Proceedings of American Control Conference (2003)","DOI":"10.1109\/ACC.2003.1243393"},{"key":"9898_CR22","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: A fixed-point continuation method for $$\\ell _1$$ \u2113 1 -regularized minimization: methodology and convergence. SIAM J. Optim. 19, 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"9898_CR23","doi-asserted-by":"crossref","unstructured":"Ji, S., Sze, K.-F., Zhou, Z., So, A., Ye, Y.: Beyond convex relaxation: a polynomial-time non-convex optimization approach to network localization. In: IEEE Conference on Computer Communications (INFOCOM), pp. 2499\u20132507 (2013)","DOI":"10.1109\/INFCOM.2013.6567056"},{"key":"9898_CR24","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"R Keshavan","year":"2010","unstructured":"Keshavan, R., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56, 2980\u20132998 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9898_CR25","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"5","author":"M-J Lai","year":"2013","unstructured":"Lai, M.-J., Xu, Y., Yin, W.: Improved iteratively rewighted least squares for unconstrained smoothed $$\\ell _p$$ \u2113 p minimization. SIAM J. Numer. Anal. 5, 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"9898_CR26","unstructured":"Lin, Z., Chen, M., Ma, Y.: The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices, NIPS (2011)"},{"key":"9898_CR27","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10107-010-0437-8","volume":"133","author":"Y Liu","year":"2012","unstructured":"Liu, Y., Sun, D., Toh, K.-C.: An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. Ser. A 133, 399\u2013436 (2012)","journal-title":"Math. Program. Ser. A"},{"key":"9898_CR28","doi-asserted-by":"crossref","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. Appl. 31, 1235\u20131256 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9898_CR29","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1080\/10556788.2014.936438","volume":"30","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Zhang, Y., Liu, X.: Penalty decomposition methods for rank minimization. Optim. Methods Softw. 30, 531\u2013558 (2015)","journal-title":"Optim. Methods Softw."},{"key":"9898_CR30","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. Ser. A 128, 321\u2013353 (2011)","journal-title":"Math. Program. Ser. A"},{"key":"9898_CR31","first-page":"3253","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithms for matrix rank minimization. J. Mach. Learn. Res. 13, 3253\u20133285 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9898_CR32","doi-asserted-by":"crossref","unstructured":"Nie, F., Huang, H., Ding, C.: Low-rank matrix recovery via efficient Schatten $$p$$ p -norm minimization. In: Proceedings of the twenty-sixth AAAI conference on artificial intelligence, pp. 655\u2013661 (2012)","DOI":"10.1609\/aaai.v26i1.8210"},{"key":"9898_CR33","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1109\/TNN.2011.2157521","volume":"22","author":"A Rakotomamonjy","year":"2011","unstructured":"Rakotomamonjy, A., Flamary, R., Gasso, G., Canu, S.: $$\\ell _p$$ \u2113 p - $$\\ell _q$$ \u2113 q penalty for sparse linear and sparse multiple kernel multitask learning. IEEE Trans. Neural Netw. 22, 1307\u20131320 (2011)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9898_CR34","first-page":"733","volume":"43","author":"G Rao","year":"2013","unstructured":"Rao, G., Peng, Y., Xu, Z.: Robust sparse and low-rank matrix decomposition based on the $$S_{1\/2}$$ S 1 \/ 2 modeling. Sci. China Inf. Sci. 43, 733\u2013748 (2013)","journal-title":"Sci. China Inf. Sci."},{"key":"9898_CR35","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.: Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"9898_CR36","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"9898_CR37","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1214\/10-AOS860","volume":"39","author":"A Rohde","year":"2011","unstructured":"Rohde, A., Tsybakov, A.: Estimation of high-dimensional low-rank matrices. Ann. Stat. 39, 887\u2013930 (2011)","journal-title":"Ann. Stat."},{"key":"9898_CR38","volume-title":"A Unified Algebraic Approach to Linear Control Design","author":"R Skelton","year":"1998","unstructured":"Skelton, R., Iwasaki, T., Grigoriadis, K.: A Unified Algebraic Approach to Linear Control Design. Taylor and Francis, Routledge (1998)"},{"key":"9898_CR39","volume-title":"Matrix Conic Programming","author":"D Sun","year":"2011","unstructured":"Sun, D.: Matrix Conic Programming. Dalian University of Science and Technology, Dalian (2011)"},{"key":"9898_CR40","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao, M., Yuan, X.: Recovering low-rank and sparse components of matrices from incomlete and noisy observations. SIAM J. Optim. 21, 57\u201381 (2011)","journal-title":"SIAM J. Optim."},{"key":"9898_CR41","first-page":"615","volume":"6","author":"K-C Toh","year":"2010","unstructured":"Toh, K.-C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pac. J. Optim. 6, 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"key":"9898_CR42","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"R T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R., Toh, K., Todd, M.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. Ser. B 95, 189\u2013217 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"9898_CR43","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4, 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"key":"9898_CR44","first-page":"3151","volume":"4","author":"Z Xu","year":"2010","unstructured":"Xu, Z.: Data modeling: visual psychology approach and $$\\ell _{1\/2}$$ \u2113 1 \/ 2 regularization theory. Proc. Int. Congr. Math. 4, 3151\u20133184 (2010)","journal-title":"Proc. Int. Congr. Math."},{"key":"9898_CR45","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $$\\ell _{1\/2}$$ \u2113 1 \/ 2 regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23, 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"9898_CR46","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.3724\/SP.J.1004.2012.01225","volume":"38","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Guo, H., Wang, Y., Zhang, H.: Representation of $$\\ell _{1\/2}$$ \u2113 1 \/ 2 regularizer among $$\\ell _q (0 < q \\le 1)$$ \u2113 q ( 0 < q \u2264 1 ) regularizer: an experimental study based on phase diagram. Acta Autom. Sin. 38, 1225\u20131228 (2012)","journal-title":"Acta Autom. Sin."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9898-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9898-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9898-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T08:23:49Z","timestamp":1658651029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9898-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,16]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9898"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9898-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,16]]}}}