4.5 Article

Projection Algorithms for Solving the Split Feasibility Problem with Multiple Output Sets

Journal

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume 190, Issue 3, Pages 861-878

Publisher

SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-021-01910-2

Keywords

Bregman distance; Bregman projection; Bregman relatively nonexpansive operator; Split common fixed point problem; Split feasibility problem

Funding

  1. Israel Science Foundation [820/17]
  2. Fund for the Promotion of Research at the Technion
  3. Technion General Research Fund
  4. Science and Technology Fund of the Vietnam Ministry of Education and Training [B2022]

Ask authors/readers for more resources

New cyclic projection algorithms based on Bregman distances are proposed for solving the split common fixed point problem for Bregman relatively nonexpansive operators and the split feasibility problem with multiple output sets in real reflexive Banach spaces.
We study the split common fixed point problem for Bregman relatively nonexpansive operators and the split feasibility problem with multiple output sets in real reflexive Banach spaces. Using Bregman distances, we propose several new cyclic projection algorithms for solving these problems.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available