A reduced-gradient variant of Karmarkar's algorithm and null-space projections (Q1090599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A reduced-gradient variant of Karmarkar's algorithm and null-space projections |
scientific article; zbMATH DE number 4008094
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reduced-gradient variant of Karmarkar's algorithm and null-space projections |
scientific article; zbMATH DE number 4008094 |
Statements
A reduced-gradient variant of Karmarkar's algorithm and null-space projections (English)
0 references
1988
0 references
The paper discusses the relationship between Karmarkar's new method for linear programming and the traditional simplex method. It is shown how null-space Karmarkar projections can be done using a basis matrix to compute the projections in the null space. Preliminary computational evidence shows that problems exist in the choice of a basis matrix, but that, given a basis, very inexact and computationally efficient projections are computationally sound.
0 references
Karmarkar's algorithm
0 references
simplex method
0 references
null-space projections
0 references
reduced- gradient methods
0 references
inexact projections
0 references
