scientific article; zbMATH DE number 3997042
From MaRDI portal
Publication:4723182
[For the entire collection see Zbl 0611.00024.] This paper describes recent developments in linear programming, including the ellipsoid algorithm, Karmarkar's algorithm, new strategies for updating LU factors in the simplex method, and methods with guaranteed termination in the presence of degeneracy and round-off errors. Various new algorithms for quadratic programming are discussed, and the choice of matrix factorizations and their updates is considered. The use of \(\ell_ 1\) penalty functions in linear and quadratic programming is also mentioned briefly.
Recommendations
- scientific article; zbMATH DE number 4119923
- scientific article; zbMATH DE number 4049377
- Linear programming: recent advances
- Some recent advances and new directions in linear programming
- Developments in linear and integer programming
- Publication:3487158
- Advances in linear and nonlinear programming
- scientific article; zbMATH DE number 107596
- scientific article; zbMATH DE number 3254598
- Commentary—Progress in Linear Programming
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723182)