Article ID: | iaor20051067 |
Country: | Germany |
Volume: | 1 |
Issue: | 1 |
Start Page Number: | 51 |
End Page Number: | 66 |
Publication Date: | Jan 2003 |
Journal: | 4OR |
Authors: | Bodon E., Spedicato E., Popolo A. Del, Mahdavi-Amiri N. |
ABS methods are a large class of methods, based upon the Egervary rank reducing algebraic process, first introduced in 18984 by Abaffy, Broyden and Spedicato for solving linear algebraic systems, and later extended to nonlinear algebraic equations, to optimization problems and other fields; software based upon ABS methods is now under development. Current ABS literature consists of about 400 papers. ABS methods provide a unification of several classes of classical algorithms and more efficient new solvers for a number of problems. In this paper we review ABS methods for linear systems and optimization, from both the point of view of theory and the numerical performance of ABSPACK.