On the Convex Feasibility Problem
The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | deu |
| Published: |
Mirton Publishing House, Timisoara
2009-01-01
|
| Series: | Anale: Seria Informatică |
| Online Access: | http://anale-informatica.tibiscus.ro/download/lucrari/7-1-24-Maruster.pdf |
| Summary: | The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness and boudedness of the intersection of the family. The case four (the interior of the intersection is empty and the intersection itself is bounded) is unsolved. In this paper we give a (partial) answer for the case four: in the case of two closed convex sets in ℝ3 the regularity property holds. |
|---|---|
| ISSN: | 1583-7165 2065-7471 |