首页 | 本学科首页   官方微博 | 高级检索  
     检索      


ABS methods and ABSPACK for linear systems and optimization: A review
Authors:Email author" target="_blank">Emilio?SpedicatoEmail author  Elena?Bodon  Antonino?Del?Popolo  Nezam?Mahdavi-Amiri
Institution:(1) Department of Mathematics, University of Bergamo, via dei Caniana 2, 24128 Bergamo, Italy;(2) Department of Mathematics, Sharif University, Tehran, Iran
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.Work partially supported by ex MURST 60% 2001 funds.E. Spedicato
Keywords:ABS methods  linear algebraic systems  feasible direction methods  simplex method  Diophantine equations  ABSPACK  
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号