A reduced-gradient variant of Karmarkar's algorithm and null-space projections

DOI10.1007/BF02346159zbMath0621.90047MaRDI QIDQ1090599

Roy E. Marsten, David F. Shanno

Publication date: 1988

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

simplex methodKarmarkar's algorithminexact projectionsnull-space projectionsreduced- gradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (4)

A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm ⋮ Implementing an affine scaling algorithm for linear programming ⋮ A modified algorithm for the strict feasibility problem ⋮ El metodo de Karmarkar: Un estudio de sus variantes

Uses Software

• XMP

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

This page was built for publication: A reduced-gradient variant of Karmarkar's algorithm and null-space projections