Karmarkar's algorithm with improved steps

DOI10.1007/BF01585728zbMath0695.90056MaRDI QIDQ910334

Bahman Kalantari

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Karmarkar's algorithmimproved steps

Mathematics Subject Classification ID

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

Related Items (5)

A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm ⋮ A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices ⋮ A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm ⋮ Generalization of Karmarkar's algorithm to convex homogeneous functions ⋮ Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A different convergence proof of the projective method for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A relaxed version of Karmarkar's method

This page was built for publication: Karmarkar's algorithm with improved steps