{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T18:04:58Z","timestamp":1765994698847,"version":"build-2065373602"},"reference-count":21,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:00:00Z","timestamp":1586563200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>This paper introduces a new three-step algorithm to solve the split feasibility problem. The main advantage is that one of the projective operators interferes only in the final step, resulting in less computations at each iteration. An example is provided to support the theoretical approach. The numerical simulation reveals that the newly introduced procedure has increased performance compared to other existing methods, including the classic CQ algorithm. An interesting outcome of the numerical modeling is an approximate visual image of the solution set.<\/jats:p>","DOI":"10.3390\/sym12040608","type":"journal-article","created":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T03:10:01Z","timestamp":1586833801000},"page":"608","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partially Projective Algorithm for the Split Feasibility Problem with Visualization of the Solution Set"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2741-2243","authenticated-orcid":false,"given":"Andreea","family":"Bejenaru","sequence":"first","affiliation":[{"name":"Department of Mathematics and Informatics, University Politehnica of Bucharest, 060042 Bucharest, Romania"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0738-787X","authenticated-orcid":false,"given":"Mihai","family":"Postolache","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Informatics, University Politehnica of Bucharest, 060042 Bucharest, Romania"},{"name":"Center for General Education, China Medical University, Taichung 40402, Taiwan"},{"name":"Gh. Mihoc-C. Iacob Institute of Mathematical Statistics and Applied Mathematics, Romanian Academy, 050711 Bucharest, Romania"}]}],"member":"1968","published-online":{"date-parts":[[2020,4,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02142692","article-title":"A multiprojection algorithm using Bregman projections in a product space","volume":"8","author":"Censor","year":"1994","journal-title":"Numer. Algorithms"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","article-title":"Iterative oblique projection onto convex sets and the split feasibility problem","volume":"18","author":"Byrne","year":"2002","journal-title":"Inverse Probl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","article-title":"An unified treatment of some iterative algorithms in signal processing and image reconstruction","volume":"20","author":"Byrne","year":"2004","journal-title":"Inverse Probl."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Tian, D., Jiang, L., and Shi, L. (2019). Gradient methods with selection technique for the multiple-sets split equality problem. Mathematics, 7.","DOI":"10.3390\/math7100928"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1080\/02331934.2019.1602772","article-title":"Gradient methods with selection technique for the multiple-sets split feasibility problem","volume":"69","author":"Yao","year":"2020","journal-title":"Optimization"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2321","DOI":"10.1080\/02331934.2014.967237","article-title":"A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces","volume":"64","author":"Vuong","year":"2014","journal-title":"Optimization"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1186\/1687-1812-2013-201","article-title":"Strong convergence of a self-adaptive method for the split feasibility problem","volume":"2013","author":"Yao","year":"2013","journal-title":"Fixed Point Theory Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2021","DOI":"10.1088\/0266-5611\/22\/6\/007","article-title":"A variable Krasnosel\u2019skii-Mann algorithm and the multiple-set split feasibility problem","volume":"22","author":"Xu","year":"2006","journal-title":"Inverse Probl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1007\/s11590-012-0506-4","article-title":"The strong convergence of a three-step algorithm for the split feasibility problem","volume":"7","author":"Dang","year":"2013","journal-title":"Optim. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2711","DOI":"10.2298\/FIL1610711T","article-title":"A new iteration scheme for approximating fixed points of nonexpensive mapping","volume":"30","author":"Thakur","year":"2016","journal-title":"Filomat"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wang, F., and Xu, H.K. (2010). Approximating curve and strong convergence of the CQ algorithm for the split feasibility problem. J. Inequal. Appl., 102085.","DOI":"10.1155\/2010\/102085"},{"key":"ref_12","first-page":"93","article-title":"A new three-step iterative algorithm for solving the split feasibility problem","volume":"81","author":"Feng","year":"2019","journal-title":"U. Politeh. Buch. Ser. A"},{"key":"ref_13","first-page":"3","article-title":"Iterative algorithms for generalized variational inequalities","volume":"81","author":"Yao","year":"2019","journal-title":"U. Politeh. Buch. Ser. A"},{"key":"ref_14","first-page":"183","article-title":"Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem","volume":"2014","author":"Yao","year":"2014","journal-title":"FixedPoint Theory Appl."},{"key":"ref_15","first-page":"875","article-title":"Mann-type iteration method for solving the split common fixed point problem","volume":"18","author":"Yao","year":"2017","journal-title":"J. Nonlinear Convex Anal."},{"key":"ref_16","first-page":"3","article-title":"Strong convergence of an extragradient algorithm for variational inequality and fixed point problems","volume":"82","author":"Yao","year":"2020","journal-title":"U. Politeh. Buch. Ser. A"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s40065-018-0236-2","article-title":"Forward-backward splitting algorithm for fixed point problems and zeros of the sum of monotone operators","volume":"9","author":"Dadashi","year":"2020","journal-title":"Arab. J. Math."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/s10957-017-1117-0","article-title":"Hybrid proximal point algorithm and applications to equilibrium problems and convex programming","volume":"174","author":"Dadashi","year":"2017","journal-title":"J. Optim. Theory Appl."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","article-title":"Weak convergence of the sequence of successive approximations for nonexpensive mappings","volume":"73","author":"Opial","year":"1967","journal-title":"Bull. Am. Math. Soc."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1017\/S0004972700028884","article-title":"Weak and strong convergence of fixed points of asymptotically nonexpansive mappings","volume":"43","author":"Schu","year":"1991","journal-title":"Bull. Austral. Math. Soc."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1090\/S0002-9939-1974-0346608-8","article-title":"Approximating fixed points of nonexpansive mappings","volume":"44","author":"Senter","year":"1974","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/4\/608\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:21:00Z","timestamp":1760361660000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/4\/608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,11]]},"references-count":21,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,4]]}},"alternative-id":["sym12040608"],"URL":"https:\/\/doi.org\/10.3390\/sym12040608","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2020,4,11]]}}}