On convex feasibility problems


Laura MărușterȘtefan Mărușter


Abstract

carpathian_2005_21_083_087_abstract

Full PDF

carpathian_2005_21_083_087

In this paper we consider a projection method for convex feasibility problem that is known to converge only weakly. Exploiting a property concerning the intersection of a family of convex closed sets, we present a condition that makes them strongly convergent, without additional assumptions.

Additional Information

Author(s)

Mărușter, Laura, Mărușter, Ștefan