Cristina Popîrlan and Claudiu Popîrlan (Romania)
convex feasibility problem, projection algorithm, Mann it eration
A well known problem, hardly studied in our days, is the convex feasibility problem. The problem is to find an ele ment in the intersection of a family of closed convex sets with nonempty intersection. In this article we analyze this problem and present an application for the convex feasibil ity problem.
Important Links:
Go Back
