Some Convergence Strategies for the Alternating Generalized Projection Method
Journal: Bulletin of Computational Applied Mathematics (Bull CompAMa) (Vol.1, No. 2)Publication Date: 2013-12-31
Authors : Maricarmen Andrade; René Escalante; Robert Espitia;
Page : 47-77
Keywords : functional differential equations; step by step Tau method; neutral delay differential equations;
Abstract
In this paper we extend the application of the alternating projection algorithm to solve the problem of finding a point in the intersection of n sets (ngeq2), which are not all of them convex sets. Here we term such method as alternating generalized projection (AGP) method. In particular, we are interested in addressing the problem of avoiding the so-called trap points, which may prevent an algorithm to obtain a feasible solution in two or more sets not all convex. Some strategies that allow us to reach the feasible solution are established and conjectured. Finally, we present simple numerical results that illustrate the efficiency of the iterative methods considered.
Other Latest Articles
- Oceanic influence on extreme rainfall trends in the north central coast of Venezuela: present and future climate assessments
- Solving the KPI wave equation with a moving adaptive FEM grid
- GNU Oflox: an academic software for the minimal cost network flow problem
- (Free) Software for general partial differential equation problems in non-rectangular 2D and 3D regions
- Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
Last modified: 2018-08-05 10:42:10