A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm

DOI10.1016/0167-6377(86)90080-5zbMath0618.90055OpenAlexW2049645719MaRDI QIDQ1089251

Kurt M. Anstreicher

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90080-5

zbMATH Keywords

convergence analysisapproximate projectionsKaramarkar's methodprojective algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Introduction: New approaches to linear programming ⋮ A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm ⋮ Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming

Cites Work

• A new polynomial-time algorithm for linear programming
• Karmarkar's algorithm with improved steps
• A reduced-gradient variant of Karmarkar's algorithm and null-space projections
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A relaxed version of Karmarkar's method
• Unnamed Item

This page was built for publication: A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm