An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
From MaRDI portal
Publication:596679
DOI10.1023/B:NUMA.0000021777.31773.c3zbMath1056.65027MaRDI QIDQ596679
Nélida E. Echebest, M. T. Guardarucci, M. C. Vacchino, H. D. Scolnik
Publication date: 10 August 2004
Published in: Numerical Algorithms (Search for Journal in Brave)
numerical examples; convergence acceleration; parallel computation; systems of linear inequalities; aggregated projection methods; incomplete projection algorithm
65K05: Numerical mathematical programming methods
90C05: Linear programming
15A39: Linear inequalities of matrices
65F10: Iterative numerical methods for linear systems
Related Items
Several acceleration schemes for solving the multiple-sets split feasibility problem, An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems, Incomplete oblique projections for solving large inconsistent linear systems, A simple projection method for solving the multiple-sets split feasibility problem
Uses Software