Abstract
We investigate CQ algorithm for the split equality problem in Hilbert spaces. In such an algorithm, the selection of the step requires prior information on the matrix norms, which is not always possible in practice. In this paper, we propose a new way to select the step so that the implementation of the algorithm does not need any prior information of the matrix norms. In Hilbert spaces, we establish the weak convergence of the proposed method to a solution of the problem under weaker conditions than usual. Preliminary numerical experiments show that the efficiency of the proposed algorithm when it applies the variable step-size.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.