Karmarkar's algorithm with improved steps

DOI10.1007/BF01585728MaRDI QIDQ910334zbMATH OpenFDO

Authors Bahman Kalantari

Publication date 1990

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

Full work available at URL https://doi.org/10.1007/BF01585728

zbMATH Keywords

Karmarkar's algorithmimproved steps

Mathematics Subject Classification ID

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

Recommendations

• On the improvement per iteration in Karmarkar's algorithm for linear programming
• The Worst-Case Step in Karmarkar's Algorithm
• scientific article; zbMATH DE number 4079165
• Short Steps with Karmarkar’s Projective Algorithm for Linear Programming
• A Self-Correcting Version of Karmarkar’s Algorithm

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• A different convergence proof of the projective method for linear programming
• A new polynomial-time algorithm for linear programming
• A relaxed version of Karmarkar's method
• An extension of Karmarkar's algorithm for linear programming using dual variables

Cited in

(7)

• Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
• The Worst-Case Step in Karmarkar's Algorithm
• A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
• A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
• Generalization of Karmarkar's algorithm to convex homogeneous functions
• scientific article; zbMATH DE number 975789 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910334)