Pages that link to "Item:Q1159953"
From MaRDI portal
The following pages link to On relaxation methods for systems of linear inequalities (Q1159953):
Displayed 10 items.
- New iterative methods for linear inequalities (Q1321142) (← links)
- A review of combinatorial problems arising in feedforward neural network design (Q1331904) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- A class of methods for solving large convex systems (Q1813379) (← links)
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
- On Chubanov's Method for Linear Programming (Q2962562) (← links)
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin (Q4999361) (← links)
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility (Q5372620) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)