ABS methods for continuous and integer linear equations and optimization
DOI10.1007/s10100-009-0128-9zbMath1204.65064OpenAlexW2018343880MaRDI QIDQ623802
Elena Bodon, Emilio Spedicato, Zun-Quan Xia, Nezam Mahdavi-Amiri
Publication date: 8 February 2011
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-009-0128-9
linear systemssimplex methodprimal-dual interior point methodsquasi-Newton equationABS methodsABSPACKDiophantine linear systemsEgerváry rank reduction matrix updatefeasible direction methods for linearly constrained optimization
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Linear programming (90C05) Iterative numerical methods for linear systems (65F10)
Related Items (10)
Cites Work
- A class of scaled direct methods for linear systems
- On the numerical stability of Huang's and related methods
- A class of direct methods for linear systems
- On solving linear Diophantine systems using generalized Rosser's algorithm
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- A direct method for the general solution of a system of linear equations
- Solution of linear least squares via the ABS algorithm
- Computational experiments with ABS algorithms for KKT linear systems
- The implicit LX method of the ABS class
- A class of ABS algorithms for Diophantine linear systems
- Symmetric and non-symmetric ABS methods for solving Diophantine systems of equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: ABS methods for continuous and integer linear equations and optimization