A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem
This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we...
Saved in:
Main Authors: | Yazheng Dang, Yan Gao, Yanli Han |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/207323 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets
by: Huijuan Jia, et al.
Published: (2021-01-01) -
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) -
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)