Journal
JOURNAL OF APPROXIMATION THEORY
Volume 142, Issue 1, Pages 36-55Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jat.2006.02.005
Keywords
convex feasibility problem; cyclic projections algorithm; rate of convergence; projections onto convex sets; POCS; alternating projections; orthogonal projections; angle between convex sets; angle between subspaces
Categories
Ask authors/readers for more resources
The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the convex feasibility problem. We study the rate of convergence for the cyclic projections algorithm. The notion of angle between convex sets is defined, which generalizes the angle between linear subspaces. The rate of convergence results are described in terms of these angles. (C) 2006 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available