Pages that link to "Item:Q3337217"
From MaRDI portal
The following pages link to Convergence of the cyclical relaxation method for linear inequalities (Q3337217):
Displaying 17 items.
- On the convergence properties of Hildreth's quadratic programming algorithm (Q749443) (← links)
- An automatic relaxation method for solving interval linear inequalities (Q1060533) (← links)
- On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
- A row-action method for convex programming (Q1330898) (← 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)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
- Primal-dual row-action method for convex programming (Q1904955) (← links)
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
- Hildreth's algorithm with applications to soft constraints for user interface layout (Q2351069) (← links)
- Convergence rates for Kaczmarz-type algorithms (Q2413487) (← links)
- On the linear convergence of the circumcentered-reflection method (Q2417091) (← links)
- On the behavior of a block-iterative projection method for solving convex feasibility problems (Q3491319) (← links)
- Asymptotically optimal row-action methods for generalized least squares problems (Q4256045) (← links)
- The Kaczmarz algorithm, row action methods, and statistical learning algorithms (Q4686248) (← links)
