On a relaxation method of solving systems of linear inequalities
From MaRDI portal
Cited in
(19)- Strong convergence of projection-like methods in Hilbert spaces
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Block-iterative surrogate projection methods for convex feasibility problems
- Projection and proximal point methods: Convergence results and counterexamples.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Linear inequalities and some of their applications
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- How good are projection methods for convex feasibility problems?
- Extrapolation algorithm for affine-convex feasibility problems
- Decomposition through formalization in a product space
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- Faster randomized block Kaczmarz algorithms
- Efficient randomized block Kaczmarz method for linear feasibility
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- Hilbertian convex feasibility problem: Convergence of projection methods
- New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them
- On linear convergence of Landweber-type methods
- Quantile-based random sparse Kaczmarz for corrupted and noisy linear systems
This page was built for publication: On a relaxation method of solving systems of linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5735509)
