Pages that link to "Item:Q3885509"
From MaRDI portal
The following pages link to The Relaxation Method for Solving Systems of Linear Inequalities (Q3885509):
Displayed 10 items.
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program (Q1260956) (← links)
- Surrogate methods for linear inequalities (Q1321147) (← links)
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II (Q1347145) (← links)
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I (Q1347165) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- A class of methods for solving large convex systems (Q1813379) (← links)
- Geometrically convergent projection method in matrix games (Q1897450) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- Primal-dual row-action method for convex programming (Q1904955) (← links)