{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:27:02Z","timestamp":1782970022664,"version":"3.54.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2013,12,14]],"date-time":"2013-12-14T00:00:00Z","timestamp":1386979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s11590-013-0701-y","type":"journal-article","created":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T11:38:18Z","timestamp":1386934698000},"page":"2053-2064","source":"Crossref","is-referenced-by-count":12,"title":["Global solutions of non-Lipschitz $$S_{2}$$ S 2 \u2013 $$S_{p}$$ S p minimization over the positive semidefinite cone"],"prefix":"10.1007","volume":"8","author":[{"given":"Yongqiang","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dingtao","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,12,14]]},"reference":[{"key":"701_CR1","unstructured":"Cai, J.F., Cand $$\\grave{\\rm e}$$ e ` s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)"},{"key":"701_CR2","doi-asserted-by":"crossref","unstructured":"Cand $$\\grave{\\rm e}$$ e ` s, E.J., Eldar, Y., Strohmer, T., Voroninski, V.: Phase retrieval via matrix completion. SIAM J. Imaging Sci. 6(1), 199\u2013225 (2013)","DOI":"10.1137\/110848074"},{"key":"701_CR3","doi-asserted-by":"crossref","unstructured":"Cand $$\\grave{\\rm e}$$ e ` s, E.J., Strohmer, T., Voroninski, V.: PhaseLift: exact and stable signal recovery from magnitude measurements via convex programming. Commun. Pure Appl. Math. 66(8), 1241\u20131274 (2013)","DOI":"10.1002\/cpa.21432"},{"key":"701_CR4","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1093\/imanum\/drq039","volume":"32","author":"CH Chen","year":"2012","unstructured":"Chen, C.H., He, B.S., Yuan, X.M.: Matrix completion via an alternating direction method. IMA J. Numer. Anal. 32, 227\u2013245 (2012)","journal-title":"IMA J. Numer. Anal."},{"key":"701_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134, 71\u201399 (2012)","journal-title":"Math. Program."},{"key":"701_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of the unconstrained $$L_2$$ L 2 - $$L_p$$ L p minimization. Math. Program. (2012). doi: 10.1007\/s10107-012-0613-0","DOI":"10.1007\/s10107-012-0613-0"},{"issue":"5","key":"701_CR7","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$$ \u2113 2 - $$\\ell _p$$ \u2113 p minimization. SIAM Sci. Comput. 32(5), 2832\u20132852 (2010)","journal-title":"SIAM Sci. Comput."},{"key":"701_CR8","doi-asserted-by":"crossref","unstructured":"Ji, S., Sze, K.F., Zhou, Z., So, A.M.C., Ye, Y.Y.: Beyond convex relaxation: a polynomial-time non-convex optimization approach to network localization. In: The Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM 2013), pp. 2499\u20132507. Torino (2013)","DOI":"10.1109\/INFCOM.2013.6567056"},{"key":"701_CR9","unstructured":"Kong, L.C., Sun, J., Xiu, N.H.: S-semigoodness for low-rank semidefinite matrix recovery. http:\/\/www.optimization-online.org\/DB_HTML\/2013\/01\/3732.html"},{"key":"701_CR10","first-page":"879","volume-title":"Handbook of Semidefinite, Cone and Polynomial Optimization","author":"N Krislock","year":"2002","unstructured":"Krislock, N., Wolkowicz, H.: Euclidean distance matrices and applications. In: Anjos, M., Lasserre, J. (eds.) Handbook of Semidefinite, Cone and Polynomial Optimization, pp. 879\u2013914. Springer, Heidelberg (2002)"},{"key":"701_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s00521-010-0371-y","volume":"20","author":"JT Li","year":"2011","unstructured":"Li, J.T., Jia, Y.M., Li, W.L.: Adaptive huberized support vector machine and its application to microarray classification. Neural Comput. Appl. 20, 123\u2013132 (2011)","journal-title":"Neural Comput. Appl."},{"key":"701_CR12","unstructured":"Lu, Y., Zhang, L.W., Wu, J.: A smoothing majorization method for $$l_2$$ l 2 - $$l_p$$ l p matrix minimization. http:\/\/www.optimization-online.org\/DB_HTML\/2013\/01\/3735.html"},{"key":"701_CR13","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, 321\u2013353 (2011)","journal-title":"Math. Program."},{"issue":"6","key":"701_CR14","first-page":"733","volume":"43","author":"G Rao","year":"2013","unstructured":"Rao, G., Peng, Y., Xu, Z.B.: Robust sparse and low-rank matrix decomposition based on $$S_{1\/2}$$ S 1 \/ 2 modeling. Science China Ser. F 43(6), 733\u2013748 (2013). In Chinese","journal-title":"Science China Ser. F"},{"key":"701_CR15","unstructured":"Sun, D.F.: The low-rank correlation matrix problems: nonconvex regularization and successive convex relaxations. Tech. Rep., Department of Mathematics, National University of Singapore (2012)"},{"key":"701_CR16","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"ZB Xu","year":"2012","unstructured":"Xu, Z.B., Chang, X., Xu, F.M., Zhang, H.: $$L_{1\/2}$$ L 1 \/ 2 regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learning Sys. 23, 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learning Sys."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0701-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0701-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0701-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T21:42:41Z","timestamp":1564954961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0701-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,14]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["701"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0701-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,14]]}}}