Rami, M. Ait; Helmke, Uwe; Moore, John
This paper develops a new variant of the classical alternating projection method for solving convex feasibility problems where the constraints are given by the intersection of two convex cones in a Hilbert space. An extension to the feasibility problem for the intersection of two convex sets is presented as well. It is shown that one can solve such problems in a finite number of steps and an explicit upper bound for the required number of steps is obtained. As an application, we propose a new...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.