Convergence of the cyclical relaxation method for linear inequalities
DOI10.1007/BF02591886zbMATH Open0545.90068DBLPjournals/mp/Mandel84WikidataQ57863173 ScholiaQ57863173MaRDI QIDQ3337217FDOQ3337217
Authors: Jan Mandel 
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
Recommendations
- A class of problems for which cyclic relaxation converges linearly
- Relaxation methods for solving linear inequality systems: converging results
- Publication:4867024
- On linear convergence of iterative methods for the variational inequality problem
- scientific article; zbMATH DE number 1270074
- Linear convergence of a method for solving variational inequalities
- Convergence of relaxation iterative methods for saddle point problem
- On the convergence of combined relaxation methods for variational inequalties
- Convergence of iterative algorithms for nonlinear variational-like inequalities
- Publication:4945990
strong underrelaxationcyclical orderasymptotically tight estimatebounds on convergencecyclical relaxationrelaxation method for linear inequalities
Numerical mathematical programming methods (65K05) Linear programming (90C05) Iterative numerical methods for linear systems (65F10) Linear inequalities of matrices (15A39)
Cites Work
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Title not available (Why is that?)
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- On solving linear complementarity problems as linear programs
- The Relaxation Method for Solving Systems of Linear Inequalities
- On certain iterative methods for solving linear systems
- A relaxation method for reconstructing objects from noisy X-rays
- Title not available (Why is that?)
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
Cited In (18)
- An automatic relaxation method for solving interval linear inequalities
- Asymptotically optimal row-action methods for generalized least squares problems
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- A class of methods for solving large convex systems
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- The Kaczmarz algorithm, row action methods, and statistical learning algorithms
- Convergence rates for Kaczmarz-type algorithms
- A row-action method for convex programming
- On the linear convergence of the circumcentered-reflection method
- 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
- Primal-dual row-action method for convex programming
- Hildreth's algorithm with applications to soft constraints for user interface layout
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Boundedness Theorems for the Relaxation Method
- On the convergence properties of Hildreth's quadratic programming algorithm
- Block-iterative surrogate projection methods for convex feasibility problems
- On some optimization techniques in image reconstruction from projections
This page was built for publication: Convergence of the cyclical relaxation method for linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337217)
