On a relaxation method of solving systems of linear inequalities

DOI10.1016/0041-5553(63)90463-4zbMath0123.11204OpenAlexW2001626469MaRDI QIDQ5735509

Ju. I. Merzljakov

Publication date: 1962

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(63)90463-4

zbMATH Keywords

numerical analysis

Related Items (16)

Strong convergence of projection-like methods in Hilbert spaces ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ How good are projection methods for convex feasibility problems? ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem ⋮ Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ Faster Randomized Block Kaczmarz Algorithms ⋮ Efficient randomized block Kaczmarz method for linear feasibility ⋮ Block-iterative projection methods for parallel computation of solutions to convex feasibility problems ⋮ Linear inequalities and some of their applications ⋮ Decomposition through formalization in a product space ⋮ On a fast deterministic block Kaczmarz method for solving large-scale linear systems

This page was built for publication: On a relaxation method of solving systems of linear inequalities