Abstract
Tseng's forward‐backward‐forward splitting method for finding zeros of the sum of Lipschitz continuous monotone and maximal monotone operators is known to converge weakly in infinite dimensional Hilbert spaces. The inertial and viscosity approximation techniques are the techniques widely used to accelerate iterative algorithms and obtain strong convergence, respectively. In this paper, we propose two fast, strongly convergent modifications of Tseng's method and present some consequences and applications of our results. Moreover, we illustrate the performance and computability of our algorithms with relevant numerical examples. The two hybrid techniques incorporate the inertial and viscosity techniques. Unlike the conventional inertial‐viscosity hybrid techniques in the literature, our new algorithms compute both the inertial extrapolation and viscosity approximation simultaneously at the first step of each iteration.
Sign-in/Register to access full text options 
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.
