The Relaxation Method for Solving Systems of Linear Inequalities
From MaRDI portal
Publication:3885509
DOI10.1287/moor.5.3.388zbMath0442.90051WikidataQ29304815 ScholiaQ29304815MaRDI QIDQ3885509
Publication date: 1980
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.5.3.388
relaxation method; finite convergence; systems of linear inequalities; subgradient optimization; obtuse polyhedra; rate of geometric convergence
90C05: Linear programming
65F10: Iterative numerical methods for linear systems
41A25: Rate of convergence, degree of approximation
52Bxx: Polytopes and polyhedra
Related Items
Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program, Surrogate methods for linear inequalities, 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, A class of methods for solving large convex systems, Geometrically convergent projection method in matrix games, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Primal-dual row-action method for convex programming
