The rate of convergence for the cyclic projections algorithm I: angles between convex sets

Authors:
Frank Deutsch;Hein Hundal
Affiliations:
Department of Mathematics, Penn State University, University Park, PA;Port Matilda, PA
Venue:
Journal of Approximation Theory
Year:
2006

Citing 4
Cited 5

Probability and statistics for the engineering, computing, and physical sciences

Probability and statistics for the engineering, computing, and physical sciences
On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
Projection algorithms and monotone operators

Projection algorithms and monotone operators
The rate of convergence for the cyclic projections algorithm II: norms of nonlinear operators

Journal of Approximation Theory

The rate of convergence for the cyclic projections algorithm II: norms of nonlinear operators

Journal of Approximation Theory
Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes

Proceedings of the 25th international conference on Machine learning
The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

Journal of Approximation Theory
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes

The Journal of Machine Learning Research
Full length article: Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space

Journal of Approximation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.