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 90
- Downloads 0
Matrix completion via a low rank factorization model and an Augmented Lagrangean Succesive Overrelaxation Algorithm
The matrix completion problem (MC) has been approximated by using the nuclear norm relaxation. Some algorithms based on this strategy require the computationally expensive singular value decomposition (SVD) at each iter...
Modeling seismic wave propagation using staggered-grid mimetic finite differences
Mimetic finite difference (MFD) approximations of continuous gradient and divergence operators satisfy a discrete version of the Gauss-Divergence theorem on staggered grids. On the mimetic approximation of this integral...
Some Convergence Strategies for the Alternating Generalized Projection Method
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...
Hole-filling techniques by using minimal energy surfaces
In the last few years, several techniques to fill holes of a given surface by means of minimal energy surfaces have been proposed. In all cases, the filling patches are obtained by minimizing an `energy functional' defin...
Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
Inexact restoration (IR) is a well established technique for continuous minimization problems with constraints that can be applied to constrained optimization problems with specific structures. When some variables are re...