Boundedness Theorems for the Relaxation Method
From MaRDI portal
Publication:5387956
DOI10.1287/moor.1050.0164zbMath1278.65073OpenAlexW2007691909MaRDI QIDQ5387956
Raphael Hauser, Edoardo Amaldi
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:afb72ae1-93cb-484d-a71b-45693247f545
condition numberrelaxation methodlinear inequalitiesconvex feasibility probleminfeasible systemsperceptron boundedness
Related Items
On Chubanov's Method for Linear Programming, A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility, A deterministic rescaled perceptron algorithm, Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin