Interative approaches to convex feasibility problems.
Solutions to convex feasibility problems are generally found by iteratively constructing sequences that converge strongly or weakly to it. In this study, four types of iteration schemes are considered in an attempt to find a point in the intersection of some closed and convex sets. The iteration sch...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10413/3967 |