A reduced-gradient variant of Karmarkar's algorithm and null-space projections
type: Item
instance of: scholarly article
title: A reduced-gradient variant of Karmarkar's algorithm and null-space projections
zbMATH Open document ID: 0621.90047
DOI: 10.1007/BF02346159
published in: Journal of Optimization Theory and Applications
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4008094
zbMATH Keywords: Karmarkar's algorithm
zbMATH Keywords: simplex method
zbMATH Keywords: null-space projections
zbMATH Keywords: reduced- gradient methods
zbMATH Keywords: inexact projections
author: David F. Shanno
author: Roy E. Marsten
describes a project that uses: XMP
MaRDI profile type: Publication
cites work: A new polynomial-time algorithm for linear programming
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Q4739659
description: scientific article; zbMATH DE number 4008094