Under and over projection methods for solving linear inequality systems
From MaRDI portal
In this paper linear inequality system are solved numerically. The authors present under and over projection scheme in the semi-infinite case. They consider a class of extended relaxation methods and prove a linear rate of convergence of the developed algorithm.
Recommendations
- scientific article; zbMATH DE number 776085
- A simultaneous projections method for linear inequalities
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- A relaxation method for solving systems with infinitely many linear inequalities
- Rate of convergence of a class of numerical methods solving linear inequality systems
Cited in
(10)- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Relaxation methods for solving linear inequality systems: converging results
- Locally polynomial method for solving systems of linear inequalities
- Rate of convergence of a class of numerical methods solving linear inequality systems
- scientific article; zbMATH DE number 4070201 (Why is no real title available?)
- The Minimax Solution of Linear Equations Subject to Linear Constraints
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- scientific article; zbMATH DE number 776085 (Why is no real title available?)
- Interval-based projection method for under-constrained numerical systems
This page was built for publication: Under and over projection methods for solving linear inequality systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844654)
