Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces

JOURNAL OF APPROXIMATION THEORY

卷:124

Article

Bregman, LM ; Censor, Y ; Reich, S ; Zepkowitz-Malachi, Y

关键词: convex set;    Dykstra's algorithm;    half-space;    projection;   

DOI  :  10.1016/j.jat.2003.08.004

来源: Elsevier

【 摘 要 】

We present a modification of Dykstra's algorithm which allows us to avoid projections onto general convex sets. Instead, we calculate projections onto either a half-space or onto the intersection of two half-spaces. Convergence of the algorithm is established and special choices of the half-spaces are proposed. The option to project onto half-spaces instead of general convex sets makes the algorithm more practical. The fact that the half-spaces are quite general enables us to apply the algorithm in a variety of cases and to generalize a number of known projection algorithms. The problem of projecting a point onto the intersection of closed convex sets receives considerable attention in many areas of mathematics and physics as well as in other fields of science and engineering such as image reconstruction from projections. In this work we propose a new class of algorithms which allow projection onto certain super half-spaces, i.e., half-spaces which contain the convex sets. Each one of the algorithms that we present gives the user freedom to choose the specific super half-space from a family of such half-spaces. Since projecting a point onto a half-space is an easy task to perform, the new algorithms may be more useful in practical situations in which the construction of the super half-spaces themselves is not too difficult. (C) 2003 Elsevier Inc. All rights reserved.

【 授权许可】

Free