Abstract
In this paper we propose an explicit algorithm for solving a variational inclusion problem of the sum of two operators, the one is maximally monotone and the other is monotone and Lipschitz continuous. The algorithm uses the variable stepsizes which are updated over each iteration by some cheap comptutations. These stepsizes are found without the prior knowledge of the Lipschitz constant of operator as well as without using lineseach procedure. The algorithm thus can be implemented easily. The convergence and the convergence rate of the algorithm are established under mild conditions. Several preliminary numerical results are provided to demonstrate the theoretical results and also to compare the new algorithm with some existing ones.
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.
