An Approximation Technique for General Split Feasibility Problems Based on Projection onto the Intersection of Half-spaces
DOI:
https://doi.org/10.58715/ncao.2023.2.1Keywords:
Split feasibility problem, Self-adaptive technique, Half-space relaxation, Strong convergenceAbstract
This paper presents a novel relaxed CQ algorithm for solving the multiple-sets split feasibility problem with multiple output sets (MSSFPMOS) in infinite-dimensional real Hilbert spaces. The proposed method replaces the projection to half-space with the projection to the intersection of two half-spaces, resulting in accelerated convergence by utilizing previous half-spaces. The present study introduces a novel algorithm that dynamically determines the stepsize, without any a priori knowledge of the operator norm required. Furthermore, the algorithm is proven to exhibit strong convergence to the minimum-norm solution of the MSSFPMOS. Finally, a number of numerical experiments have been conducted to showcase the impressive performance of the proposed algorithm.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Guash Haile Taddele, Songpon Sriwongsa
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Open Access Policy
This journal provides immediate open access to its content on the principle that making research freely available to the public.
Publication Charges
There are no charges to submit and publish an article in the Nonlinear Convex Analysis and Optimization (NCAO): An International Journal on Numerical, Computation and Applications. All articles published in our journal are open access and are freely and widely available to all readers via the journal website.