An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms

DOI10.1023/B:NUMA.0000021777.31773.c3zbMath1056.65027OpenAlexW2032138022MaRDI QIDQ596679

M. C. Vacchino, M. T. Guardarucci, Nélida E. Echebest, H. D. Scolnik

Publication date: 10 August 2004

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:numa.0000021777.31773.c3

zbMATH Keywords

numerical examplesconvergence accelerationparallel computationsystems of linear inequalitiesaggregated projection methodsincomplete projection algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39) Iterative numerical methods for linear systems (65F10)

Related Items (5)

Several acceleration schemes for solving the multiple-sets split feasibility problem ⋮ Incomplete oblique projections for solving large inconsistent linear systems ⋮ A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations ⋮ A simple projection method for solving the multiple-sets split feasibility problem ⋮ An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems

Uses Software

• SPARSKIT

This page was built for publication: An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms