Abstract
In this article, we propose four alternated inertial algorithms for finding a common solution of equilibrium problems and split feasibility problems in Hilbert spaces. We present a variable step size, which is not required to know the operator norm. Furthermore, these algorithms adopt the new convex subset form by a sequence of closed balls instead of half spaces, and it is easy to calculate the projections onto these sets. We establish strong and weak convergence theorems of these algorithms under some proper assumptions and also present a numerical experiment to illustrate the performance and the advantage of the proposed algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
