Iterative Approximation to Convex Feasibility Problems in Banach Space
The convex feasibility problem (CFP) of finding a point in the nonempty intersection ∩i=1NCi is considered, where N≥1 is an integer and each Ci is assumed to be the fixed point set of a nonexpansive mapping Ti:E→E, where E is a reflexive Banach space with a weakly sequentially continu...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2007-04-01
|
| Series: | Fixed Point Theory and Applications |
| Online Access: | http://dx.doi.org/10.1155/2007/46797 |