{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:39:56Z","timestamp":1772908796404,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T00:00:00Z","timestamp":1665705600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T00:00:00Z","timestamp":1665705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-022-01246-9","type":"journal-article","created":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T07:03:38Z","timestamp":1665731018000},"page":"619-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery"],"prefix":"10.1007","volume":"87","author":[{"given":"Haitao","family":"Che","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaru","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiju","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,14]]},"reference":[{"key":"1246_CR1","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\u201353 (2002)","journal-title":"Inverse Probl."},{"key":"1246_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"P Calamai","year":"1987","unstructured":"Calamai, P., Mor\u00e8, J.: Projected gradient methods for linearly constrained problems. Math. Program. 39, 93\u2013116 (1987)","journal-title":"Math. Program."},{"issue":"2","key":"1246_CR3","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e9s","year":"2006","unstructured":"Cand\u00e9s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1246_CR4","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 projection in a product space. Numer. Algorithms 8, 221\u2013239 (1994)","journal-title":"Numer. Algorithms"},{"key":"1246_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and nonsmooth analysis (2nd edn), Classics in Applied Mathematics 5. SIAM, Philadelphia (1990)","DOI":"10.1137\/1.9781611971309"},{"key":"1246_CR6","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.3934\/jimo.2016078","volume":"13","author":"Y Dang","year":"2017","unstructured":"Dang, Y., Sun, J., Xu, H.: Inertial accelerated algorithm for solving a split feasibility problem. J. Ind. Manag. Optim. 13, 1383\u20131394 (2017)","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"1246_CR7","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1016\/j.neucom.2015.08.055","volume":"173","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Hu, J.: A neural network for $$l_1-l_2$$ minimization based on scaled gradient projection: Application to compressed sensing. Neurocomputing 173(3), 988\u2013993 (2016)","journal-title":"Neurocomputing"},{"key":"1246_CR8","first-page":"374","volume":"8","author":"G L\u00f3pez","year":"2012","unstructured":"L\u00f3pez, G., Martn-M\u00e1rquez, V., Wang, F., Xu, H.: Solving the split feasibility problem without prior knowledge of matrix norm. Inverse Probl. 8, 374\u2013389 (2012)","journal-title":"Inverse Probl."},{"key":"1246_CR9","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s11228-008-0102-z","volume":"16","author":"P Maing\u00e9","year":"2008","unstructured":"Maing\u00e9, P.: Strong convergence of projected subgradient methods for nonsmooth and non-strictly convex minimization. Set Valued Var. Anal. 16, 899\u2013912 (2008)","journal-title":"Set Valued Var. Anal."},{"issue":"1","key":"1246_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.jmaa.2005.05.028","volume":"318","author":"G Marino","year":"2006","unstructured":"Marino, G., Xu, H.: A general iterative method for nonexpansive mappings in Hilbert spaces. J. Math. Anal. Appl. 318(1), 43\u201352 (2006)","journal-title":"J. Math. Anal. Appl."},{"key":"1246_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.: Numerical optimization. Springer-Verlag, New York (1999)"},{"issue":"5","key":"1246_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"B Polyak","year":"1964","unstructured":"Polyak, B.: Some methods of speeding up the convergence of iteration methods. Ussr Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"Ussr Comput. Math. Math. Phys."},{"key":"1246_CR13","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s11075-020-00999-2","volume":"87","author":"D Sahu","year":"2021","unstructured":"Sahu, D., Cho, Y., Dong, Q., Kashyap, M., Li, X.: Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces. Numer. Algorithms 87, 1075\u20131095 (2021)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"1246_CR14","doi-asserted-by":"publisher","first-page":"988","DOI":"10.3934\/jimo.2018023","volume":"14","author":"S Suantai","year":"2018","unstructured":"Suantai, S., Pholasa, N., Cholamjiak, P.: The modified inertial relaxed CQ algorithm for solving the split feasibility problems. J. Ind. Manag. Optim. 14(4), 988\u2013993 (2018)","journal-title":"J. Ind. Manag. Optim."},{"issue":"42","key":"1246_CR15","doi-asserted-by":"publisher","first-page":"7268","DOI":"10.1002\/mma.5836","volume":"3","author":"R Suparatulatorn","year":"2019","unstructured":"Suparatulatorn, R., Charoensawan, P., Poochinapan, K.: Inertial self-adaptive algorithm for solving split feasible problems with applications to image restoration. Math. Methods Appl. Sci. 3(42), 7268\u20137284 (2019)","journal-title":"Math. Methods Appl. Sci."},{"issue":"1","key":"1246_CR16","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1112\/S0024610702003332","volume":"66","author":"H Xu","year":"2002","unstructured":"Xu, H.: Iterative algorithms for nonlinear operators. J. London Math. Soc. 66(1), 240\u2013256 (2002)","journal-title":"J. London Math. Soc."},{"key":"1246_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jmaa.2004.07.048","volume":"302","author":"Q Yang","year":"2005","unstructured":"Yang, Q.: On variable-step relaxed projection algorithm for variational inequalities. J. Math. Anal. Appl. 302, 166\u2013179 (2005)","journal-title":"J. Math. Anal. Appl."},{"key":"1246_CR18","volume-title":"Projections on convex sets in Hilbert space and spectral theory, Contributions to Nonlinear Functional Analysis","author":"EH Zarantonello","year":"1971","unstructured":"Zarantonello, E.H.: Projections on convex sets in Hilbert space and spectral theory, Contributions to Nonlinear Functional Analysis. Academic Press, New York (1971)"},{"key":"1246_CR19","doi-asserted-by":"crossref","unstructured":"Xu B., Liu Q., Huang T.: A discrete-time projection neural network for sparse signal reconstruction with application to face recognition. IEEE Trans. Neural Netw. Learn. Syst. (2018)","DOI":"10.1109\/TNNLS.2018.2836933"},{"key":"1246_CR20","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1109\/LSP.2020.3027490","volume":"27","author":"K Garg","year":"2020","unstructured":"Garg, K., Baranwal, M.: CAPPA: continuous-time accelerated proximal point algorithm for sparse recovery. IEEE Signal Process. Lett. 27, 1760\u20131764 (2020)","journal-title":"IEEE Signal Process. Lett."},{"issue":"11","key":"1246_CR21","doi-asserted-by":"publisher","first-page":"7266","DOI":"10.1016\/j.jfranklin.2020.04.022","volume":"357","author":"A Abubakar","year":"2020","unstructured":"Abubakar, A., Kumam, P., Mohammad, H., Awwa, A.: A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration. J. Frankl. Inst. 357(11), 7266\u20137285 (2020)","journal-title":"J. Frankl. Inst."},{"issue":"1","key":"1246_CR22","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1186\/1687-1812-2014-202","volume":"2014","author":"K Sakurai","year":"2014","unstructured":"Sakurai, K., Iiduka, H.: Acceleration of the halpern algorithm to search for a fixed point of a nonexpansive mapping. Fixed Point Theory Appl. 2014(1), 202 (2014)","journal-title":"Fixed Point Theory Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01246-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01246-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01246-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T23:57:16Z","timestamp":1698796636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01246-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,14]]},"references-count":22,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1246"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01246-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,14]]},"assertion":[{"value":"27 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}