No label defined (Q4723182)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3997042 |
Statements
1987
0 references
linear programming
0 references
ellipsoid algorithm
0 references
Karmarkar's algorithm
0 references
simplex method
0 references
degeneracy
0 references
round-off errors
0 references
quadratic programming
0 references
matrix factorizations
0 references
penalty functions
0 references
0 references
0.9292041
0 references
0.91990465
0 references
0.91208935
0 references
0.9103679
0 references
[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.
0 references