On finitely convergent iterative methods for the convex feasibility problem |
| |
| Authors: | Alfredo N Iusem Leonardo Moledo |
| |
| Institution: | (1) Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina 110, 22.460 Rio de Janeiro, RJ, Brasil;(2) Instituto de Investigaciones Económicas, Universidad de Buenos Aires, Córdoba 2122, 1120 Buenos Aires, Argentina |
| |
| Abstract: | Iterative algorithms for the Convex Feasibility Problem can be modified so that at iterationk the original convex sets are perturbed with a parameter εk which tends to zero ask increases. We establish conditions on such algorithms which guarantee existence of a sequence of perturbation parameters
which make them finitely convergent when applied to a convex feasibility problem whose feasible set has non empty interior. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
