TOMS552
Constrained Overdetermined Linear Systems in L1.

TOMS552 is a FORTRAN77 library which implements ACM TOMS algorithm 552.

TOMS552 computes a solution X for an overdetermined constrained linear system, minimizing the L1 error.

The overdetermined linear system being solved is

A * X = B.

The equality constraints have the form:

C * X = D

and the inequality constraints have the form:

E * X >= F.

The program is required to seek a solution X which satisfies the constraints, and which minimizes the L1 norm (sum of absolute values of components) of A*X-B.

The original, true, correct version of ACM TOMS 552 is available in the TOMS subdirectory of the NETLIB web site.

Languages:

TOMS552 is available in a FORTRAN77 version and a FORTRAN90 version.

Author:

Ian Barrodale,
Frank Roberts.

Reference:

Ian Barrodale, Frank Roberts,
Algorithm 552: Solution of the Constrained L1 Approximation Problem,
ACM Transactions on Mathematical Software,
Volume 6, Number 2, March 1980, pages 231-235.
Helmuth Spaeth,
Mathematical Algorithms for Linear Regression,
Academic Press, 1991,
ISBN: 0-12-656460-4,
LC: QA278.2.S6313.

Source Code:

toms552.f, the source code.
toms552.sh, commands to compile the source code.

Examples and Tests:

toms552_prb.f, a sample calling program.
toms552_prb.sh, commands to compile and run the sample program.
toms552_prb_input.txt, an input file for use with the sample program.
toms552_prb_output.txt, the output from a run of the sample program.

List of Routines:

CL1 solves a linear programming problem.
COL adds a multiple of vector V2 to vector V1.
TIMESTAMP prints the current YMDHMS date as a time stamp.

You can go up one level to the FORTRAN77 source codes.

Last revised on 28 December 2007.