Iterative method for solving the linear feasibility problem

DOI10.1007/s10957-007-9163-7zbMath1165.90010OpenAlexW1980382020MaRDI QIDQ946322

R. Dudek

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

zbMATH Keywords

metric projectionssurrogate constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)

Related Items

Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space, Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy

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