Journal of Nonlinear and Variational Analysis

Full Text: PDF
DOI: 10.23952/jnva.7.2023.6.06

Volume 7, Issue 6, 1 December 2023, Pages 971-984

 

Abstract. Bregman distance iterative methods for solving optimization problems are important and interesting because of the numerous applications of Bregman distance techniques. In this paper, for solving a split feasibility problem, we introduce a new Bregman projection algorithm and construct two selection strategies of stepsizes. Moreover, a relaxed Bregman projection algorithm is proposed with two selection strategies of stepsizes, where the two closed and convex sets are both level sets of convex functions. Weak convergence results of the proposed algorithms are obtained under suitable assumptions. In addition, using the proposed algorithms with different Bregman distances, a numerical experiment solving signal processing problem is also given to demonstrate the effectiveness of the proposed algorithms.

 

How to Cite this Article:
Y. Hao, J. Zhao, New Bregman projection algorithms for solving the split feasibility problem, J. Nonlinear Var. Anal. 7 (2023), 971-984.