Iterative method for solving the linear feasibility problem
From MaRDI portal
Publication:946322
DOI10.1007/s10957-007-9163-7zbMath1165.90010MaRDI QIDQ946322
Publication date: 23 September 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9163-7
65K05: Numerical mathematical programming methods
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C05: Linear programming
Cites Work
- Unnamed Item
- Relaxed outer projections, weighted averages and convex feasibility
- A simultaneous projections method for linear inequalities
- New iterative methods for linear inequalities
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- The method of projections for finding the common point of convex sets