Computing Karmarkar projections quickly (Q1107438)
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 4064761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Karmarkar projections quickly |
scientific article; zbMATH DE number 4064761 |
Statements
Computing Karmarkar projections quickly (English)
0 references
1988
0 references
The paper presents and investigates a numerical method for computing the projections for Karmarkar's algorithm for linear programming. A comparison is carried out with known methods that factor the matrix at each iteration. The numerical results obtained show that the proposed method promises advantages.
0 references
Cholesky factorization
0 references
computation of projections
0 references
rank one updates
0 references
sparsity
0 references
Karmarkar's algorithm
0 references
0 references
0.8602598309516907
0 references
0.8573225736618042
0 references
0.8352446556091309
0 references
