Abstract.
ABS methods are a large class of methods, based upon the Egervary rank reducing algebraic process, first introduced in 1984 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Work partially supported by ex MURST 60% 2001 funds.
E. Spedicato
Rights and permissions
About this article
Cite this article
Spedicato, E., Bodon, E., Popolo, A.D. et al. ABS methods and ABSPACK for linear systems and optimization: A review. 4OR 1, 51–66 (2003). https://doi.org/10.1007/s10288-002-0004-0
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10288-002-0004-0