In this paper, we study the alternating CQ algorithm for solving the split equality problem in Hilbert spaces. It is, however, not easy to implement since its selection of the stepsize requires prior information on the norms of bounded linear operators. To avoid this difficulty, we propose several modified algorithms in which the selection of the stepsize is independent of the norms. In particular, we consider the case whenever the convex sets involved are level sets of given convex functions.

中文翻译：

---

在没有算子范数的先验知识的情况下，分裂等式问题的交替迭代算法

在本文中，我们研究了用于解决希尔伯特空间中的分裂等式问题的交替CQ算法。但是，由于步长的选择需要关于有界线性算子的范数的先验信息，因此实现起来并不容易。为了避免这个困难，我们提出了几种改进的算法，其中步长的选择与规范无关。特别是，当涉及的凸集是给定凸函数的水平集时，我们考虑这种情况。