Iterative Approximation to Convex Feasibility Problems in Banach Space
<p/> <p>The convex feasibility problem (CFP) of finding a point in the nonempty intersection <inline-formula><graphic file="1687-1812-2007-046797-i1.gif"/></inline-formula> is considered, where <inline-formula><graphic file="1687-1812-2007-046797...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2007-01-01
|
| Series: | Fixed Point Theory and Applications |
| Online Access: | http://www.fixedpointtheoryandapplications.com/content/2007/046797 |