Some Convergence Strategies for the Alternating Generalized Projection Method
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2013, Vol 1, Issue 2
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 ($n\geq2$), 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.
Authors and Affiliations
Maricarmen Andrade, René Escalante, Robert Espitia
Keywords
Related Articles
- EP ID EP245540
- DOI -
- Views 60
- Downloads 0
Motion planning algorithms, topological properties and affine approximation
The topological study of the so-called "motion planning algorithms" emerged in the 2003-2004 with the works of M. Farber. We focus here on the topological study of the set of these algorithms, when the configuration spac...
Quadrature formulae of Euler-Maclaurin type based on generalized Euler polynomials of level m
This article deals with some properties -which are, to the best of our knowledge, new- of the generalized Euler polynomials of level $m$. These properties include a new recurrence relation satisfied by these polynomials...
Redox reactions as experimental examples of ternary weak algebraic hyperstructures
A ternary hyperoperation on a set H is a 3-ary hyperoperation, which associates a subset of H with any three elements of H. In this paper, we give examples of ternary hyperoperations associated with redox reactions. We...
A deterministic optimization approach for solving the rainfall disaggregation problem
One of the main problems in hydrology is the time scale of the historical rainfall data, available from many meteorological data bases. Most of the rainfall data is given at a time scale coarser than the one needed for...
Total dominator chromatic number of some operations on a graph
Let <i>G</i> be a simple graph. A total dominator coloring of <i>G</i> is a proper coloring of the vertices of <i>G</i> in which each vertex of the graph is adjacent to every vertex of some color class. The total dominat...