An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate xk+1by projecting the current point zk onto a separating hyperplane generated by a given linear combination of the original hyperplanes or halfspaces. In H. Scolnik et al we i...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Articulo Preprint |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/149696 |
| Aporte de: |
| Sumario: | The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate xk+1by projecting the current point zk onto a separating hyperplane generated by a given linear combination of the original hyperplanes or halfspaces. In H. Scolnik et al we introduced acceleration schemes for solving systems of linear equations by applying optimization techniques to the problem of finding the optimal combination of the hyperplanes within a PAM like framework. In this paper we generalize those results, introducing a new accelerated iterative method for solving systems of linear inequalities, together with the corresponding theoretical convergence results. In order to test its efficiency, numerical results obtained applying the new acceleration scheme to two algorithms introduced by U. M. García-Palomares and F. J. González-Castaño are given. |
|---|