Abstract
This paper concerns with a new three-operator splitting algorithm for solving a class of variational inclusions. The main advantage of the proposed algorithm is that it can be easily implemented without the prior knowledge of Lipschitz constant, strongly monotone constant and cocoercive constant of component operators. A reason explained for this is that the algorithm uses a sequence of stepsizes which is diminishing and non-summable. The strong convergence of the algorithm is established. Several fundamental numerical experiments are given to illustrate the behavior of the new algorithm and compare it with other algorithms.
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.
