A Self-adaptive Super Set-relaxed Projection Method for Multiple-sets Split Feasibility Problem with Multiple Output Sets
DOI:
https://doi.org/10.58715/ncao.2024.3.4Keywords:
Split feasibility problem, Self-adaptive technique, Half-space relaxation, Strong convergenceAbstract
This paper introduces an inertial accelerated super set-relaxed CQ method to solve a multiple-sets split feasibility problem with multiple output sets. The convex subsets involved are assumed to be level subsets of given strongly convex functions. Instead of using the involved sets, we approximate the original convex subsets with a sequence of closed balls. The proposed method is easy to implement as the projection onto the closed ball has a closed form. Additionally, we develop a new self-adaptive step-size that does not require any prior information of the norm. Under suitable assumptions, we establish and prove a strong convergence result for the algorithm. Numerical experiments are provided to demonstrate the performance of the proposed algorithm, which generalizes and improves upon existing literature.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Guash Haile Taddele, Songpon Sriwongsa, Attapol Kaewkhao
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.