Technical Note—The Nested Ball Principle for the Relaxation Method
From MaRDI portal
Publication:3664819
DOI10.1287/opre.31.3.587zbMath0516.90047OpenAlexW2019504447MaRDI QIDQ3664819
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.3.587
ellipsoid algorithmrelaxation methodfeasible solutionnested ball principlesequence of shrinking ballsset of linear inequalities
Linear programming (90C05) Linear inequalities of matrices (15A39) Iterative numerical methods for linear systems (65F10)
Related Items
Block-iterative surrogate projection methods for convex feasibility problems, An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence