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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Echebest, Nélida Ester, Guardarucci, María Teresa, Scolnik, Hugo Daniel, Vacchino, María Cristina
Formato: Articulo Preprint
Lenguaje:Inglés
Publicado: 2001
Materias:
Matemática
Aggregated projection methods
Systems of inequalities
Incomplete projections
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/149696
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-149696
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Matemática
Aggregated projection methods
Systems of inequalities
Incomplete projections
spellingShingle Matemática
Aggregated projection methods
Systems of inequalities
Incomplete projections
Echebest, Nélida Ester
Guardarucci, María Teresa
Scolnik, Hugo Daniel
Vacchino, María Cristina
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
topic_facet Matemática
Aggregated projection methods
Systems of inequalities
Incomplete projections
description 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.
format Articulo
Preprint
author Echebest, Nélida Ester
Guardarucci, María Teresa
Scolnik, Hugo Daniel
Vacchino, María Cristina
author_facet Echebest, Nélida Ester
Guardarucci, María Teresa
Scolnik, Hugo Daniel
Vacchino, María Cristina
author_sort Echebest, Nélida Ester
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
publishDate 2001
url http://sedici.unlp.edu.ar/handle/10915/149696
work_keys_str_mv AT echebestnelidaester anaccelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms
AT guardaruccimariateresa anaccelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms
AT scolnikhugodaniel anaccelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms
AT vacchinomariacristina anaccelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms
AT echebestnelidaester accelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms
AT guardaruccimariateresa accelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms
AT scolnikhugodaniel accelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms
AT vacchinomariacristina accelerationschemeforsolvingconvexfeasibilityproblemsusingincompleteprojectionalgorithms
bdutipo_str Repositorios
_version_ 1764820461815857153

Ejemplares similares