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: | Echebest, Nélida Ester, Guardarucci, María Teresa, Scolnik, Hugo Daniel, Vacchino, María Cristina |
|---|---|
| Formato: | Articulo Preprint |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/149696 |
| Aporte de: |
Ejemplares similares
-
An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
por: Echebest, N., et al. -
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)