An Implicit Algorithm for the Split Fixed Point and Convex Feasibility Problems
We consider an implicit algorithm for the split fixed point and convex feasibility problems. Strong convergence theorem is obtained.
Saved in:
Main Authors: | Fengjun Guo, Shin Min Kang, Young Chel Kwun |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2013/854893 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some Fixed Points Results of Quadratic Functions in Split Quaternions
by: Young Chel Kwun, et al.
Published: (2016-01-01) -
Fixed Point Approximation for Asymptotically Nonexpansive Type Mappings in Uniformly Convex Hyperbolic Spaces
by: Shin Min Kang, et al.
Published: (2015-01-01) -
Non-Convex Split Feasibility Problems: Models, Algorithms and Theory
by: Gibali, Aviv, et al.
Published: (2020-10-01) -
Strong Convergence for Hybrid Implicit S-Iteration Scheme of Nonexpansive and Strongly Pseudocontractive Mappings
by: Shin Min Kang, et al.
Published: (2014-01-01) -
Damped Algorithms for the Split Fixed Point and Equilibrium Problems
by: Li-Jun Zhu, et al.
Published: (2013-01-01)