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: | , , |
|---|---|
| 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!
|