{"date_created":"2020-06-04T11:28:33Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"oa_version":"Published Version","scopus_import":"1","publisher":"Springer Nature","status":"public","title":"New inertial relaxed method for solving split feasibilities","quality_controlled":"1","day":"01","file":[{"date_updated":"2024-03-07T14:58:51Z","date_created":"2024-03-07T14:58:51Z","file_size":2148882,"success":1,"file_id":"15089","checksum":"63c5f31cd04626152a19f97a2476281b","relation":"main_file","access_level":"open_access","creator":"kschuh","file_name":"2021_OptimizationLetters_Shehu.pdf","content_type":"application/pdf"}],"type":"journal_article","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2024-03-07T15:00:43Z","article_processing_charge":"Yes (via OA deal)","month":"09","date_published":"2021-09-01T00:00:00Z","publication_status":"published","abstract":[{"text":"In this paper, we introduce a relaxed CQ method with alternated inertial step for solving split feasibility problems. We give convergence of the sequence generated by our method under some suitable assumptions. Some numerical implementations from sparse signal and image deblurring are reported to show the efficiency of our method.","lang":"eng"}],"department":[{"_id":"VlKo"}],"volume":15,"intvolume":"        15","year":"2021","file_date_updated":"2024-03-07T14:58:51Z","isi":1,"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The authors are grateful to the referees for their insightful comments which have improved the earlier version of the manuscript greatly. The first author has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","ddc":["510"],"project":[{"call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"doi":"10.1007/s11590-020-01603-1","page":"2109-2126","has_accepted_license":"1","author":[{"orcid":"0000-0001-9224-7139","last_name":"Shehu","first_name":"Yekini","full_name":"Shehu, Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Aviv","last_name":"Gibali","full_name":"Gibali, Aviv"}],"publication":"Optimization Letters","publication_identifier":{"issn":["1862-4472"],"eissn":["1862-4480"]},"external_id":{"isi":["000537342300001"]},"ec_funded":1,"citation":{"mla":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” <i>Optimization Letters</i>, vol. 15, Springer Nature, 2021, pp. 2109–26, doi:<a href=\"https://doi.org/10.1007/s11590-020-01603-1\">10.1007/s11590-020-01603-1</a>.","ieee":"Y. Shehu and A. Gibali, “New inertial relaxed method for solving split feasibilities,” <i>Optimization Letters</i>, vol. 15. Springer Nature, pp. 2109–2126, 2021.","ama":"Shehu Y, Gibali A. New inertial relaxed method for solving split feasibilities. <i>Optimization Letters</i>. 2021;15:2109-2126. doi:<a href=\"https://doi.org/10.1007/s11590-020-01603-1\">10.1007/s11590-020-01603-1</a>","ista":"Shehu Y, Gibali A. 2021. New inertial relaxed method for solving split feasibilities. Optimization Letters. 15, 2109–2126.","chicago":"Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.” <i>Optimization Letters</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11590-020-01603-1\">https://doi.org/10.1007/s11590-020-01603-1</a>.","apa":"Shehu, Y., &#38; Gibali, A. (2021). New inertial relaxed method for solving split feasibilities. <i>Optimization Letters</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11590-020-01603-1\">https://doi.org/10.1007/s11590-020-01603-1</a>","short":"Y. Shehu, A. Gibali, Optimization Letters 15 (2021) 2109–2126."},"article_type":"original","language":[{"iso":"eng"}],"_id":"7925"}