A Finite Steps Algorithm for Solving Convex Feasibility Problems
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]
|Collections||ANU Research Publications|
|Source:||Journal of Global Optimization|
|01_Rami_A_Finite_Steps_Algorithm_for_2007.pdf||265.5 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.