{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T14:54:49Z","timestamp":1772636089305,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T00:00:00Z","timestamp":1604620800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T00:00:00Z","timestamp":1604620800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["No. 3122019142"],"award-info":[{"award-number":["No. 3122019142"]}],"id":[{"id":"10.13039\/501100012226","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":[[2021,4]]},"DOI":"10.1007\/s10898-020-00963-3","type":"journal-article","created":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T02:02:59Z","timestamp":1604628179000},"page":"813-836","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["General splitting methods with linearization for the split feasibility problem"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6765-4437","authenticated-orcid":false,"given":"Qiao-Li","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songnian","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael Th.","family":"Rassias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"963_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s11228-017-0461-4","volume":"26","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R.: Solving graph coloring problems with the Douglas\u2013Rachford algorithm. Set Valued Var. Anal. 26, 277\u2013304 (2018)","journal-title":"Set Valued Var. Anal."},{"issue":"2","key":"963_CR2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10898-019-00867-x","volume":"77","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R., Elser, V.: An enhanced formulation for solving graph coloring problems with the Douglas\u2013Rachford algorithm. J. Glob. Optim. 77(2), 383\u2013403 (2020)","journal-title":"J. Glob. Optim."},{"key":"963_CR3","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s10898-012-9958-4","volume":"57","author":"FJ Arag\u00f3n Artacho","year":"2013","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M.: Global convergence of a non-convex Douglas\u2013Rachford iteration. J. Glob. Optim. 57, 753\u2013769 (2013)","journal-title":"J. Glob. Optim."},{"key":"963_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-013-0488-0","volume":"163","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Recent results on Douglas\u2013Rachford methods for combinatorial optimization problems. J. Optim. Theory App. 163, 1\u201330 (2014)","journal-title":"J. Optim. Theory App."},{"key":"963_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"key":"963_CR6","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s00013-014-0652-2","volume":"102","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Noll, D.: On the local convergence of the Douglas\u2013Rachford algorithm. Arch. Math. 102, 589\u2013600 (2014)","journal-title":"Arch. Math."},{"key":"963_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-016-1086-3","volume":"164","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Moursi, W.M.: On the Douglas\u2013Rachford algorithm. Math. Program. 164, 263\u2013284 (2017)","journal-title":"Math. Program."},{"key":"963_CR8","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/15M1016989","volume":"26","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Moursi, W.M.: The Douglas\u2013Rachford algorithm for two (not necessarily intersecting) affine subspaces. SIAM J. Optim. 26, 968\u2013985 (2016)","journal-title":"SIAM J. Optim."},{"key":"963_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-013-0381-x","volume":"160","author":"JM Borwein","year":"2014","unstructured":"Borwein, J.M., Tam, M.K.: A cyclic Douglas\u2013Rachford iteration scheme. J. Optim. Theory Appl. 160, 1\u201329 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"963_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","volume":"18","author":"CL Byrne","year":"2002","unstructured":"Byrne, C.L.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18, 441\u2013453 (2002)","journal-title":"Inverse Probl."},{"key":"963_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","volume":"20","author":"CL Byrne","year":"2004","unstructured":"Byrne, C.L.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103\u2013120 (2004)","journal-title":"Inverse Probl."},{"key":"963_CR12","volume-title":"Iterative Methods for Fixed Point Problems in Hilbert Spaces","author":"A Cegielski","year":"2012","unstructured":"Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Springer, Berlin (2012)"},{"key":"963_CR13","doi-asserted-by":"crossref","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":"963_CR14","doi-asserted-by":"crossref","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\u2013Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Signal Process. 1, 564\u2013574 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"963_CR15","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.3934\/jimo.2018135","volume":"15","author":"Y Dang","year":"2019","unstructured":"Dang, Y., Sun, J., Zhang, S.: Double projection algorithms for solving the split feasibility problems. J. Ind. Manag. Optim. 15, 2023\u20132034 (2019)","journal-title":"J. Ind. Manag. Optim."},{"issue":"9","key":"963_CR16","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1080\/02331934.2014.895897","volume":"64","author":"QL Dong","year":"2015","unstructured":"Dong, Q.L., He, S., Zhao, J.: Solving the split equality problem without prior knowledge of operator norms. Optimization 64(9), 1887\u20131906 (2015)","journal-title":"Optimization"},{"key":"963_CR17","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2020.1753741","author":"QL Dong","year":"2020","unstructured":"Dong, Q.L., Li, X.H., Rassias, T.M.: Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models. Optimization (2020). https:\/\/doi.org\/10.1080\/02331934.2020.1753741","journal-title":"Optimization"},{"key":"963_CR18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10898-018-0628-z","volume":"71","author":"QL Dong","year":"2018","unstructured":"Dong, Q.L., Tang, Y.C., Cho, Y.J., Rassias, T.M.: \u201cOptimal\u201d choice of the step length of the projection and contraction methods for solving the split feasibility problem. J. Glob. Optim. 71, 341\u2013360 (2018)","journal-title":"J. Glob. Optim."},{"key":"963_CR19","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1007\/s11590-013-0619-4","volume":"8","author":"QL Dong","year":"2014","unstructured":"Dong, Q.L., Yao, Y., He, S.: Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in hilbert spaces. Optim. Lett. 8, 1031\u20131046 (2014)","journal-title":"Optim. Lett."},{"key":"963_CR20","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two or three space variables. Trans. Am. Math. Soc. 82, 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"key":"963_CR21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"963_CR22","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BF01589441","volume":"35","author":"MA Fukushima","year":"1986","unstructured":"Fukushima, M.A.: relaxed projection method for variational inequalities. Math. Program. 35, 58\u201370 (1986)","journal-title":"Math. Program."},{"key":"963_CR23","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/s11590-017-1148-3","volume":"12","author":"A Gibali","year":"2018","unstructured":"Gibali, A., Liu, L., Tang, Y.C.: Note on the modified relaxation CQ algorithm for the split feasibility problem. Optim. Lett. 12, 817\u2013830 (2018)","journal-title":"Optim. Lett."},{"key":"963_CR24","doi-asserted-by":"crossref","unstructured":"Giselsson, P., Boyd, S.: Diagonal scaling in Douglas\u2013Rachford splitting and ADMM. In: Proceedings of the 53rd IEEE Conference on Decision and Control, pp. 5033\u20135039 (2014)","DOI":"10.1109\/CDC.2014.7040175"},{"key":"963_CR25","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $$O(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"963_CR26","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1137\/13090849X","volume":"24","author":"B He","year":"2014","unstructured":"He, B., Liu, H., Wang, Z., Yuan, X.: A strictly contractive Peaceman\u2013Rachford splitting method for convex programming. SIAM J. Optim. 24(3), 1011\u20131040 (2014)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"963_CR27","first-page":"1199","volume":"19","author":"S He","year":"2018","unstructured":"He, S., Xu, H.K.: The selective projection method for convex feasibility and split feasibility problems. J. Nonlinear Sci. Appl. 19(7), 1199\u20131215 (2018)","journal-title":"J. Nonlinear Sci. Appl."},{"key":"963_CR28","doi-asserted-by":"crossref","first-page":"4868","DOI":"10.1109\/TSP.2014.2339801","volume":"62","author":"R Hesse","year":"2014","unstructured":"Hesse, R., Luke, D.R., Neumann, P.: Alternating projections and Douglas\u2013Rachford for sparse affine feasibility. IEEE Trans. Signal. Proces. 62, 4868\u20134881 (2014)","journal-title":"IEEE Trans. Signal. Proces."},{"key":"963_CR29","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10589-017-9915-8","volume":"68","author":"G Li","year":"2017","unstructured":"Li, G., Liu, T., Pong, T.K.: Peaceman\u2013Rachford splitting for a class of nonconvex optimization problems. Comput. Optim. Appl. 68, 407\u2013436 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"963_CR30","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-015-0963-5","volume":"159","author":"G Li","year":"2016","unstructured":"Li, G., Pong, T.K.: Douglas\u2013Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159, 371\u2013401 (2016)","journal-title":"Math. Program."},{"key":"963_CR31","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s10957-019-01564-1","volume":"183","author":"M Li","year":"2019","unstructured":"Li, M., Wu, Z.: Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems. J Optim. Theory Appl. 183, 535\u2013565 (2019)","journal-title":"J Optim. Theory Appl."},{"key":"963_CR32","unstructured":"Lindstrom, S.B., Sims, B., Survey: Sixty Years of Douglas\u2013Rachford (2020). https:\/\/arxiv.org\/abs\/1809.07181?context=math"},{"key":"963_CR33","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"963_CR34","doi-asserted-by":"crossref","first-page":"085004","DOI":"10.1088\/0266-5611\/28\/8\/085004","volume":"27","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. 27, 085004 (2012)","journal-title":"Inverse Probl."},{"key":"963_CR35","doi-asserted-by":"crossref","first-page":"2099","DOI":"10.1007\/s11590-013-0708-4","volume":"8","author":"A Moudafi","year":"2014","unstructured":"Moudafi, A., Thakur, B.S.: Solving proximal split feasibility problems without prior knowledge of operator norms. Optim. Lett. 8, 2099\u20132110 (2014)","journal-title":"Optim. Lett."},{"key":"963_CR36","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0103003","volume":"3","author":"DW Peaceman","year":"1955","unstructured":"Peaceman, D.W., Rachford, H.H.: The numerical solution of parabolic and elliptic differential equations. J. Soc. Ind. Appl. Math. 3, 28\u201341 (1955)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"963_CR37","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10589-016-9884-3","volume":"67","author":"B Qu","year":"2017","unstructured":"Qu, B., Wang, C., Xiu, N.: Analysis on Newton projection method for the split feasibility problem. Comput. Optim. Appl. 67, 175\u2013199 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"963_CR38","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1002\/mma.4644","volume":"41","author":"Y Shehu","year":"2018","unstructured":"Shehu, Y., Iyiola, O.S.: Nonlinear iteration method for proximal split feasibility problems. Math. Method Appl. Sci. 41, 781\u2013802 (2018)","journal-title":"Math. Method Appl. Sci."},{"key":"963_CR39","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/18M1163993","volume":"30","author":"A Themelis","year":"2020","unstructured":"Themelis, A., Patrinos, P.: Douglas\u2013Rachford splitting and ADMM for nonconvex optimization: tight convergence results. SIAM J. Optim. 30, 149\u2013181 (2020)","journal-title":"SIAM J. Optim."},{"key":"963_CR40","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. Stat. Methodol. 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"issue":"5","key":"963_CR41","doi-asserted-by":"crossref","first-page":"055017","DOI":"10.1088\/1361-6420\/aa6699","volume":"33","author":"J Wang","year":"2017","unstructured":"Wang, J., Hu, Y., Li, C., Yao, J.C.: Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Probl. 33(5), 055017 (2017)","journal-title":"Inverse Probl."},{"key":"963_CR42","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1007\/s10589-019-00088-8","volume":"73","author":"D Wang","year":"2019","unstructured":"Wang, D., Wang, X.: A parameterized Douglas\u2013Rachford algorithm. Comput. Optim. Appl. 73, 839\u2013869 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"963_CR43","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1007\/s11075-017-0347-4","volume":"77","author":"F Wang","year":"2018","unstructured":"Wang, F.: Polyak\u2019s gradient method for split feasibility problem constrained by level sets. Numer. Algorithms 77, 925\u2013938 (2018)","journal-title":"Numer. Algorithms"},{"key":"963_CR44","doi-asserted-by":"crossref","first-page":"055017","DOI":"10.1088\/1361-6420\/aa6699","volume":"33","author":"JH Wang","year":"2017","unstructured":"Wang, J.H., Hu, Y.H., Li, C., Yao, J.C.: Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Probl. 33, 055017 (2017)","journal-title":"Inverse Probl."},{"key":"963_CR45","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1007\/s10898-018-00735-0","volume":"73","author":"LH Yen","year":"2019","unstructured":"Yen, L.H., Huyen, N.T.T., Muu, L.D.: A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models. J. Glob. Optim. 73, 849\u2013868 (2019)","journal-title":"J. Glob. Optim."},{"key":"963_CR46","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s00186-016-0553-1","volume":"84","author":"LH Yen","year":"2016","unstructured":"Yen, L.H., Muu, L.D., Huyen, N.T.T.: An algorithm for a class of split feasibility problems: application to a model in electricity production. Math. Methods Oper. Res. 84, 549\u2013565 (2016)","journal-title":"Math. Methods Oper. Res."},{"key":"963_CR47","doi-asserted-by":"crossref","first-page":"2619","DOI":"10.1080\/02331934.2014.883515","volume":"64","author":"J Zhao","year":"2015","unstructured":"Zhao, J.: Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms. Optimization 64, 2619\u20132630 (2015)","journal-title":"Optimization"},{"key":"963_CR48","doi-asserted-by":"crossref","first-page":"035009","DOI":"10.1088\/0266-5611\/27\/3\/035009","volume":"27","author":"J Zhao","year":"2011","unstructured":"Zhao, J., Yang, Q.: Self-adaptive projection methods for the multiple-sets split feasibility problem. Inverse Probl. 27, 035009 (2011)","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-00963-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00963-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00963-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T00:27:53Z","timestamp":1723854473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00963-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,6]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["963"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00963-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,6]]},"assertion":[{"value":"8 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}