An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets
The paper proposes an inertial accelerated algorithm for solving split feasibility problem with multiple output sets. To improve the feasibility, the algorithm involves computing of projections onto relaxed sets (half spaces) instead of computing onto the closed convex sets, and it does not require...
Saved in:
Main Authors: | Huijuan Jia, Shufen Liu, Yazheng Dang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/6252984 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Inertial Iterative Algorithm with Strong Convergence for Solving Modified Split Feasibility Problem in Banach Spaces
by: Huijuan Jia, et al.
Published: (2021-01-01) -
An Extrapolated Iterative Algorithm for Multiple-Set Split Feasibility Problem
by: Yazheng Dang, et al.
Published: (2012-01-01) -
A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem
by: Yazheng Dang, et al.
Published: (2012-01-01) -
Inertial Iteration for Split Common Fixed-Point Problem for Quasi-Nonexpansive Operators
by: Yazheng Dang, et al.
Published: (2013-01-01) -
On Two Projection Algorithms for the Multiple-Sets Split Feasibility Problem
by: Qiao-Li Dong, et al.
Published: (2013-01-01)