Convergence of the cyclical relaxation method for linear inequalities

DOI10.1007/BF02591886zbMath0545.90068WikidataQ57863173 ScholiaQ57863173MaRDI QIDQ3337217

Jan Mandel

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

strong underrelaxationcyclical orderasymptotically tight estimatebounds on convergencecyclical relaxationrelaxation method for linear inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39) Iterative numerical methods for linear systems (65F10)

Related Items

A row-action method for convex programming, Asymptotically optimal row-action methods for generalized least squares problems, About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II, About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I, Block-iterative surrogate projection methods for convex feasibility problems, Primal-dual row-action method for convex programming, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, On some optimization techniques in image reconstruction from projections, On the behavior of a block-iterative projection method for solving convex feasibility problems, Convergence rates for Kaczmarz-type algorithms, The Kaczmarz algorithm, row action methods, and statistical learning algorithms, On the convergence properties of Hildreth's quadratic programming algorithm, A class of methods for solving large convex systems, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, An automatic relaxation method for solving interval linear inequalities, Hildreth's algorithm with applications to soft constraints for user interface layout

Cites Work

• Unnamed Item
• Unnamed Item
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• On certain iterative methods for solving linear systems
• The Relaxation Method for Solving Systems of Linear Inequalities
• On the non-polynomiality of the relaxation method for systems of linear inequalities
• A relaxation method for reconstructing objects from noisy X-rays
• On solving linear complementarity problems as linear programs
• An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities