An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems

DOI10.1007/s10479-005-2456-zzbMath1091.90039OpenAlexW2017898621MaRDI QIDQ817152

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

Publication date: 7 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-2456-z

zbMATH Keywords

oblique projectionsexact projectionincomplete projectionsprojected aggregation methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

An acceleration scheme for Dykstra's algorithm

Uses Software

• ITSOL
• SPARSKIT

Cites Work

• Unnamed Item
• An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
• Convergence results for an accelerated nonlinear Cimmino algorithm
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Incomplete projection algorithms for solving the convex feasibility problem
• A class of optimized row projection methods for solving large nonsymmetric linear systems
• Acceleration scheme for parallel projected aggregation methods for solving large linear systems
• Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
• The method of projections for finding the common point of convex sets
• Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems