科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we consider the split equality problem (SEP): find x is an element of C, y is an element of Q such that Ax = By, where C and Q are nonempty closed convex subsets of R-n and R-m, A is a p x n matrix, and B is a p x m matrix, respectively. One drawback of the existing algorithm for the SEP is that one has to compute or estimate the matrix norms. In this paper, we construct a new algorithm in a way that the implementation of the algorithm does not need any prior information of the matrix norms. Under some mild conditions, we establish the convergence of the proposed algorithm to a solution of the SEP.
