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+1 by projecting the current point xk onto a separating hyperplane generated by a given linear combination of the original hyperplanes or half-spaces. In [12] we introduced...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_10171398_v35_n2-4_p331_Echebest |
| Aporte de: |
| id |
todo:paper_10171398_v35_n2-4_p331_Echebest |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_10171398_v35_n2-4_p331_Echebest2023-10-03T15:56:23Z An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms Echebest, N. Guardarucci, M.T. Scolnik, H. Vacchino, M.C. Aggregated projection methods Incomplete projections Systems of inequalities The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate xk+1 by projecting the current point xk onto a separating hyperplane generated by a given linear combination of the original hyperplanes or half-spaces. In [12] 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 García-Palomares and González- Castaño [6] are given. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_10171398_v35_n2-4_p331_Echebest |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Aggregated projection methods Incomplete projections Systems of inequalities |
| spellingShingle |
Aggregated projection methods Incomplete projections Systems of inequalities Echebest, N. Guardarucci, M.T. Scolnik, H. Vacchino, M.C. An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms |
| topic_facet |
Aggregated projection methods Incomplete projections Systems of inequalities |
| description |
The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate xk+1 by projecting the current point xk onto a separating hyperplane generated by a given linear combination of the original hyperplanes or half-spaces. In [12] 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 García-Palomares and González- Castaño [6] are given. |
| format |
JOUR |
| author |
Echebest, N. Guardarucci, M.T. Scolnik, H. Vacchino, M.C. |
| author_facet |
Echebest, N. Guardarucci, M.T. Scolnik, H. Vacchino, M.C. |
| author_sort |
Echebest, N. |
| title |
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms |
| title_short |
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms |
| title_full |
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms |
| title_fullStr |
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms |
| title_full_unstemmed |
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms |
| title_sort |
acceleration scheme for solving convex feasibility problems using incomplete projection algorithms |
| url |
http://hdl.handle.net/20.500.12110/paper_10171398_v35_n2-4_p331_Echebest |
| work_keys_str_mv |
AT echebestn anaccelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms AT guardaruccimt anaccelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms AT scolnikh anaccelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms AT vacchinomc anaccelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms AT echebestn accelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms AT guardaruccimt accelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms AT scolnikh accelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms AT vacchinomc accelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms |
| _version_ |
1807319930765312000 |