The Mathematical Institute, University of Oxford, Eprints Archive

Boundedness Theorems for the Relaxation Method

Amaldi, Edoardo and Hauser, Raphael (2003) Boundedness Theorems for the Relaxation Method. Technical Report. Unspecified. (Submitted)

[img]
Preview
PDF
264Kb

Abstract

A classical theorem by Block and Levin says that certain variants of the relaxation method for solving systems of linear inequalities produce bounded sequences of intermediate solutions even when running on inconsistent input data. Using a new approach, we prove a more general version of this result and answer an old open problem of quantifying the bounds as a function of the input data.

Raphael Hauser was supported through grant NAL/00720/G from the Nuffield Foundation and through grant GR/M30975 from the Engineering and Physical Sciences Research Council of the UK.

Item Type:Technical Report (Technical Report)
Subjects:H - N > Linear and multilinear algebra; matrix theory
O - Z > Statistics
O - Z > Operations research, mathematical programming
A - C > Computer science
A - C > Combinatorics
A - C > Convex and discrete geometry
H - N > Numerical analysis
Research Groups:Numerical Analysis Group
ID Code:1190
Deposited By:Lotti Ekert
Deposited On:18 May 2011 08:13
Last Modified:18 May 2011 08:13

Repository Staff Only: item control page