{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:25:13Z","timestamp":1774373113619,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T00:00:00Z","timestamp":1583884800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T00:00:00Z","timestamp":1583884800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hong Kong Research Grants Council","award":["PolyU153085\/16p."],"award-info":[{"award-number":["PolyU153085\/16p."]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11601162"],"award-info":[{"award-number":["11601162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2017A030310167"],"award-info":[{"award-number":["2017A030310167"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10898-020-00899-8","type":"journal-article","created":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T06:02:40Z","timestamp":1583906560000},"page":"107-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection"],"prefix":"10.1007","volume":"78","author":[{"given":"Chen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting Kei","family":"Pong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lulin","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liaoyuan","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,11]]},"reference":[{"key":"899_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"PA Absil","year":"2012","unstructured":"Absil, P.A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22, 135\u2013158 (2012)","journal-title":"SIAM J. Optim."},{"key":"899_CR2","first-page":"218","volume":"38","author":"E Asplund","year":"1973","unstructured":"Asplund, E.: Differentiability of the metric projection in finite-dimensional Euclidean space. Proc. Am. Math. Soc. 38, 218\u2013219 (1973)","journal-title":"Proc. Am. Math. Soc."},{"key":"899_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116, 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"899_CR4","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"899_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"899_CR6","volume-title":"Asymptotic Cones and Functions in Optimization and Variational Inequalities","author":"A Auslender","year":"2003","unstructured":"Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer, Berlin (2003)"},{"key":"899_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.13001\/1081-3810.2943","volume":"29","author":"A Berman","year":"2015","unstructured":"Berman, A., D\u00fcr, M., Shaked-Monderer, N.: Open problems in the theory of completely positive and copositive matrices. Electron. J. Linear Algebra 29, 46\u201358 (2015)","journal-title":"Electron. J. Linear Algebra"},{"key":"899_CR8","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17, 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"899_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.laa.2015.05.021","volume":"482","author":"IM Bomze","year":"2015","unstructured":"Bomze, I.M., Dickinson, P.J.C., Still, G.: The structure of completely positive matrices according to their CP-rank and CP-plus-rank. Linear Algebra Appl. 482, 191\u2013206 (2015)","journal-title":"Linear Algebra Appl."},{"key":"899_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","volume":"18","author":"C Byrne","year":"2002","unstructured":"Byrne, C.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18, 441\u2013453 (2002)","journal-title":"Inverse Probl."},{"key":"899_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02142692","volume":"8","author":"Y Censor","year":"1994","unstructured":"Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8, 221\u2013239 (1994)","journal-title":"Numer. Algorithms"},{"key":"899_CR12","doi-asserted-by":"publisher","first-page":"2071","DOI":"10.1088\/0266-5611\/21\/6\/017","volume":"21","author":"Y Censor","year":"2005","unstructured":"Censor, Y., Elfving, T., Kopf, N., Bortfeld, T.: The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 21, 2071\u20132084 (2005)","journal-title":"Inverse Probl."},{"key":"899_CR13","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1016\/j.jmaa.2006.05.010","volume":"327","author":"Y Censor","year":"2007","unstructured":"Censor, Y., Motova, A., Segal, A.: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem. J. Math. Anal. Appl. 327, 1244\u20131256 (2007)","journal-title":"J. Math. Anal. Appl."},{"key":"899_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJC Dickinson","year":"2014","unstructured":"Dickinson, P.J.C., Gijben, L.: On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57, 403\u2013415 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"899_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1, 211\u2013218 (1936)","journal-title":"Psychometrika"},{"key":"899_CR16","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, Berlin (2003)"},{"key":"899_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2019.12.024","volume":"591","author":"P Groetzner","year":"2020","unstructured":"Groetzner, P., D\u00fcr, M.: A factorization method for completely positive matrices. Linear Algebra Appl. 591, 1\u201324 (2020)","journal-title":"Linear Algebra Appl."},{"key":"899_CR18","unstructured":"Kyrillidis, A., Becker, S., Cevher, V., Koch, C.: Sparse projections onto the simplex. In: Proceedings of the 30th International Conference on Machine Learning, pp. 280\u2013288 (2013)"},{"key":"899_CR19","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10208-008-9036-y","volume":"9","author":"AS Lewis","year":"2009","unstructured":"Lewis, A.S., Luke, D.R., Malick, J.: Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9, 485\u2013513 (2009)","journal-title":"Found. Comput. Math."},{"key":"899_CR20","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka\u2013\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18, 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"key":"899_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-019-00067-z","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A refined convergence analysis of pDCA$$_e$$ with applications to simultaneous sparse recovery and outlier detection. Comput. Optim. Appl. (2019). https:\/\/doi.org\/10.1007\/s10589-019-00067-z","journal-title":"Comput. Optim. Appl."},{"key":"899_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1327-8","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Program. (2019). https:\/\/doi.org\/10.1007\/s10107-018-1327-8","journal-title":"Math. Program."},{"key":"899_CR23","doi-asserted-by":"publisher","first-page":"085004","DOI":"10.1088\/0266-5611\/28\/8\/085004","volume":"28","author":"G L\u00f3pez","year":"2012","unstructured":"L\u00f3pez, G., Mart\u00edn-M\u00e1rquez, V., Wang, F., Xu, H.-K.: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 28, 085004 (2012)","journal-title":"Inverse Probl."},{"key":"899_CR24","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23, 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"key":"899_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation, I: Basic Theory","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, I: Basic Theory. Springer, Berlin (2006)"},{"key":"899_CR26","unstructured":"Neyshabur, B., Panigrahy, R.: Sparse matrix factorization (2014). arXiv:1311.3315"},{"key":"899_CR27","doi-asserted-by":"crossref","unstructured":"Polania, L.F., Carrillo, R.E., Blanco-Velasco, M., Barner, K.E.: Compressive sensing for ECG signals in the presence of electromyographic noise. In: Proceedings of the 38th Annual Northeast Bioengineering Conference, pp. 295\u2013296 (2012)","DOI":"10.1109\/NEBC.2012.6207081"},{"key":"899_CR28","doi-asserted-by":"publisher","first-page":"5231","DOI":"10.1090\/S0002-9947-00-02550-2","volume":"352","author":"RA Poliquin","year":"2000","unstructured":"Poliquin, R.A., Rockafellar, R.T., Thibault, L.: Local differentiability of distance functions. Trans. Am. Math. Soc. 352, 5231\u20135249 (2000)","journal-title":"Trans. Am. Math. Soc."},{"key":"899_CR29","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1088\/0266-5611\/21\/5\/009","volume":"21","author":"B Qu","year":"2005","unstructured":"Qu, B., Xiu, N.: A note on the CQ algorithm for the split feasibility problem. Inverse Probl. 21, 1655\u20131665 (2005)","journal-title":"Inverse Probl."},{"key":"899_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"899_CR31","doi-asserted-by":"publisher","first-page":"2275","DOI":"10.1080\/02331934.2017.1370648","volume":"66","author":"Y Shehu","year":"2017","unstructured":"Shehu, Y., Iyiola, O.S.: Strong convergence result for proximal split feasibility problem in Hilbert spaces. Optimization 66, 2275\u20132290 (2017)","journal-title":"Optimization"},{"key":"899_CR32","first-page":"5347","volume":"217","author":"Z Wang","year":"2011","unstructured":"Wang, Z., Yang, Q., Yang, Y.: The relaxed inexact projection methods for the split feasibility problem. Appl. Math. Comput. 217, 5347\u20135359 (2011)","journal-title":"Appl. Math. Comput."},{"key":"899_CR33","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10589-018-0025-z","volume":"71","author":"J Xu","year":"2018","unstructured":"Xu, J., Chi, E.C., Yang, M., Lange, K.: A majorization\u2013minimization algorithm for split feasibility problems. Comput. Optim. Appl. 71, 795\u2013828 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"899_CR34","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1088\/0266-5611\/20\/4\/014","volume":"20","author":"Q Yang","year":"2004","unstructured":"Yang, Q.: The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 20, 1261\u20131266 (2004)","journal-title":"Inverse Probl."},{"key":"899_CR35","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1088\/0266-5611\/21\/5\/017","volume":"21","author":"J Zhao","year":"2005","unstructured":"Zhao, J., Yang, Q.: Several solution methods for the split feasibility problem. Inverse Probl. 21, 1791\u20131799 (2005)","journal-title":"Inverse Probl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00899-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00899-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00899-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:12:51Z","timestamp":1615421571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00899-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,11]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["899"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00899-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,11]]},"assertion":[{"value":"4 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}