Journal of Applied Analysis
Vol. 3, No. 2, pp. 269-284 (2003)
An adaptive parallel projection method for solving convex feasibility problems
G. CrombezGilbert Crombez
University of Ghent
Department of applied mathematics and informatics
Krijgslaan 281 / S9
B-9000 GENT, Belgium
Abstract: We present an adaptation of the (by now classical) parallel projection method for finding a point in the nonempty intersection of a finite number of closed convex sets in a Hilbert space. The adaptation consists of controlling at each iteration step whether or not some condition is fulfilled; if not, the adapted next iteration point is determined such that its position with respect to the intersection is better than the usual next iteration point. This may improve the speed of convergence.
Keywords: Solving convex feasibility problems, parallel projection method, block-iterative projection method
Classification (MSC2000): 65JXX, 46C05, 49MXX, 68U10
Full text of the article:
Electronic version published on: 12 Jun 2003. This page was last modified: 12 Jun 2003.