{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:24:50Z","timestamp":1774373090727,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:00:00Z","timestamp":1503014400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"EU FP7 IRSES program STREVCOMS","award":["PIRSES-GA-2013-612669"],"award-info":[{"award-number":["PIRSES-GA-2013-612669"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11075-017-0398-6","type":"journal-article","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T11:12:45Z","timestamp":1503054765000},"page":"739-757","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["l 1-l 2 regularization of split feasibility problems"],"prefix":"10.1007","volume":"78","author":[{"given":"Abdellatif","family":"Moudafi","sequence":"first","affiliation":[]},{"given":"Aviv","family":"Gibali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,18]]},"reference":[{"key":"398_CR1","doi-asserted-by":"crossref","unstructured":"Alghamdi, M.A., Ali Alghamdi, M., Shahzad, N., Naseer, H.-K. X.: Properties and Iterative Methods for the Q-Lasso, Abstract and Applied Analysis. Article ID 250943, 8 pages (2013)","DOI":"10.1155\/2013\/250943"},{"key":"398_CR2","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 Prob. 18, 441\u2013453 (2002)","journal-title":"Inverse Prob."},{"key":"398_CR3","doi-asserted-by":"publisher","first-page":"103\u00c2","DOI":"10.1088\/0266-5611\/20\/1\/006","volume":"20","author":"C Byrne","year":"2004","unstructured":"Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Prob. 20, 103\u00c2\u2013120 (2004)","journal-title":"Inverse Prob."},{"key":"398_CR4","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1088\/0031-9155\/51\/10\/001","volume":"51","author":"Y Censor","year":"2006","unstructured":"Censor, Y., Bortfeld, T., Martin, B., Trofimov, A.: A unified approach for inversion problems in intensity-modulated radiation therapy. Phys. Med. Biol. 51, 2353\u20132365 (2006)","journal-title":"Phys. Med. Biol."},{"key":"398_CR5","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":"398_CR6","doi-asserted-by":"publisher","first-page":"610","DOI":"10.4208\/jcm.1606-m2016-0581","volume":"34","author":"Y Censor","year":"2016","unstructured":"Censor, Y., Gibali, A., Lenzen, F., Schnorr, Ch.: The implicit convex feasibility problem and its application to adaptive image denoising. J. Comput. Math. 34, 610\u2013625 (2016)","journal-title":"J. Comput. Math."},{"key":"398_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process Lett. 14, 707\u2013710 (2007)","journal-title":"IEEE Signal Process Lett."},{"key":"398_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S Chen","year":"1998","unstructured":"Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM J. Comput. 20, 33\u201361 (1998)","journal-title":"SIAM J. Comput."},{"key":"398_CR9","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1137\/080727749","volume":"2","author":"C Chaux","year":"2009","unstructured":"Chaux, C., Pesquet, J.-C., Pustelnik, N.: Nested iterative algorithms for convex constrained image recovery problems. SIAM J. Imag. Sci. 2, 730\u2013762 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"398_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"398_CR11","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/JSTSP.2007.910264","volume":"1","author":"PL Combettes","year":"2007","unstructured":"Combettes, P.L., Pesquet, J.-C.: A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Sign. Proces. 1, 564\u2013574 (2007)","journal-title":"IEEE J. Sel. Top. Sign. Proces."},{"key":"398_CR12","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/LSP.2014.2322123","volume":"21","author":"L Condat","year":"2014","unstructured":"Condat, L.: A generic proximal algorithm for convex optimization: application to total variation minimization. IEEE Signal Process Lett. 21, 985\u2013989 (2014)","journal-title":"IEEE Signal Process Lett."},{"key":"398_CR13","doi-asserted-by":"publisher","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":"398_CR14","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1137\/13090540X","volume":"6","author":"E Esser","year":"2013","unstructured":"Esser, E., Lou, Y., Xin, J.: A method for finding structured sparse solutions to non-negative least squares problems with applications. SIAM J. Imag. Sci. 6, 2010\u20132046 (2013)","journal-title":"SIAM J. Imag. Sci."},{"key":"398_CR15","doi-asserted-by":"crossref","unstructured":"Lou, Y., Yan, M.: Fast l 1 \u2212 l 2 Minimization via a proximal operator. arXiv: 1609.09530 (2017)","DOI":"10.1007\/s10915-017-0463-2"},{"key":"398_CR16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10444-011-9243-y","volume":"38","author":"ChA Micchelli","year":"2013","unstructured":"Micchelli, Ch.A., Shen, L., Xu, Y., Zeng, X.: Proximity algorithms for the L 1\/TV image denoising model. Adv. Comput. Math. 38, 401\u2013426 (2013)","journal-title":"Adv. Comput. Math."},{"key":"398_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF00935173","volume":"33","author":"H Mine","year":"1981","unstructured":"Mine, H., Fukushima, M.: A minimization method for the sum of a convex function and a continuously differentiable function. J. Optim. Theory Appl. 33, 9\u201323 (1981)","journal-title":"J. Optim. Theory Appl."},{"key":"398_CR18","unstructured":"Moudafi, A.: About proximal algorithms for Q-Lasso, Thai Mathematical Journal (2016)"},{"key":"398_CR19","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24, 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"398_CR20","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 Prob. 21, 1655\u20131665 (2005)","journal-title":"Inverse Prob."},{"key":"398_CR21","doi-asserted-by":"publisher","unstructured":"Tang, Y.-C., Liu, L.-W., Gibali, A.: Note on the modified relaxation CQ algorithm for the split feasibility problem. Optim. Lett., 1\u201314. https:\/\/doi.org\/10.1007\/s11590-017-1148-3 (2017)","DOI":"10.1007\/s11590-017-1148-3"},{"key":"398_CR22","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 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"398_CR23","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of l 1\u22122 for compressed sensing. SIAM J. Sci. Comput. 37, 536\u2013563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"398_CR24","doi-asserted-by":"publisher","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.: L 1\u22122 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":"398_CR25","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.dsp.2014.03.010","volume":"31","author":"X Zeng","year":"2014","unstructured":"Zeng, X., Figueiredo, M.A.-T.: Solving OSCAR regularization problems by fast approximate proximal splittings algorithms. Digital Signal Process. 31, 124\u2013135 (2014)","journal-title":"Digital Signal Process."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0398-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0398-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0398-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T10:30:17Z","timestamp":1719397817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0398-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,18]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["398"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0398-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,18]]},"assertion":[{"value":"13 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}