Pages that link to "Item:Q1321142"
From MaRDI portal
The following pages link to New iterative methods for linear inequalities (Q1321142):
Displayed 11 items.
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- Iterative method for solving the linear feasibility problem (Q946322) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- Geometry of optimal value functions with applications to redundancy in linear programming (Q1331104) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- On the entropic regularization method for solving min-max problems with applications (Q1366322) (← links)
- Entropic perturbation method for solving a system of linear inequalities (Q1612393) (← links)
- Geometrically convergent projection method in matrix games (Q1897450) (← links)
- Incomplete alternating projection method for large inconsistent linear systems (Q2472379) (← links)
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
- Projection methods for the linear split feasibility problems (Q3514829) (← links)