Abstract
<abstract> In this work, we introduce two modified Tseng's splitting algorithms with a new non-monotone adaptive step size for solving monotone inclusion problem in the framework of Banach spaces. Under some mild assumptions, we establish the weak and strong convergence results of the proposed algorithms. Moreover, we also apply our results to variational inequality problem, convex minimization problem and signal recovery, and provide several numerical experiments including comparisons with other related algorithms. </abstract>
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.
