Title :
On convex feasibility problems
Author :
L. Maruster;S. Maruster
Author_Institution :
Fac. of Manage. & Organ., Groningen Univ., Netherlands
fDate :
6/26/1905 12:00:00 AM
Abstract :
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
Keywords :
"Signal processing algorithms","Projection algorithms","Hilbert space","Convergence","Application software","Space technology","Constraint optimization","Economic forecasting","Statistics","Prediction theory"
Conference_Titel :
Information Technology Interfaces, 2004. 26th International Conference on
Print_ISBN :
953-96769-9-1
