An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
DOI10.1007/S10479-005-2456-ZzbMATH Open1091.90039OpenAlexW2017898621MaRDI QIDQ817152FDOQ817152
M. C. Vacchino, M. T. Guardarucci, N. Echebest, H. Scolnik
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
Recommendations
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
- Incomplete oblique projections for solving large inconsistent linear systems
- Acceleration scheme for parallel projected aggregation methods for solving large linear systems
- New optimized and accelerated PAM methods for solving large non-symmetric linear systems: Theory and practice
- Iterative method for solving the linear feasibility problem
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- The method of projections for finding the common point of convex sets
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
- Incomplete projection algorithms for solving the convex feasibility problem
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- Acceleration scheme for parallel projected aggregation methods for solving large linear systems
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- New optimized and accelerated PAM methods for solving large non-symmetric linear systems: Theory and practice
Cited In (5)
- A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems
- New optimized and accelerated PAM methods for solving large non-symmetric linear systems: Theory and practice
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
- An acceleration scheme for Dykstra's algorithm
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
Uses Software
This page was built for publication: An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817152)
