Self-adaptive-type CQ algorithms for split equality problems

TL;DR

This paper introduces two self-adaptive algorithms for split equality problems that do not require prior knowledge of operator norms, with proven convergence and demonstrated efficiency through numerical experiments.

Contribution

It proposes novel self-adaptive algorithms for split equality problems, eliminating the need for operator norm knowledge and providing convergence guarantees.

Findings

Algorithms converge strongly under mild conditions.

Numerical experiments show improved efficiency.

Results outperform existing methods.

Abstract

The purpose of this paper is concerned with the approximate solution of split equality problems. We introduce two types of algorithms and a new self-adaptive stepsize without prior knowledge of operator norms. The corresponding strong convergence theorems are obtained under mild conditions. Finally, some numerical experiments demonstrate the efficiency of our results and compare them with the existing results.