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: | Echebest, N., Guardarucci, M.T., Scolnik, H., Vacchino, M.C. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_10171398_v35_n2-4_p331_Echebest |
| Aporte de: |
Ejemplares similares
-
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
por: Echebest, Nélida Ester, et al.
Publicado: (2001) -
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
Publicado: (2004) -
An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
por: Echebest, N., et al. -
An incomplete projections algorithm for solving large inconsistent linear systems
por: Scolnik, Hugo Daniel, et al.
Publicado: (2005) -
An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
Publicado: (2005)