Year-end Sale % OFF 
Abstract
We are concerned in this paper with the convergence analysis of the primal-dual splitting (PDS) and the split Douglas-Rachford (SDR) algorithms for monotone inclusions by using an operator-oriented approach. We shall show that both PDS and SDR algorithms can be driven by a (firmly) nonexpansive mapping in a product Hilbert space. We are then able to apply the Krasnoselskii-Mann and Halpern fixed point algorithms to PDS and SDR to get weakly and strongly convergent algorithms for finding solutions of the primal and dual monotone inclusions. Moreover, an additional projection technique is used to derive strong convergence of a modified SDR algorithm.
Published Version
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.
