A Self-Correcting Version of Karmarkar’s Algorithm

DOI10.1137/0726056MaRDI QIDQ4730699zbMATH OpenOpenAlexFDO

Authors Donald Goldfarb, Sanjay Mehrotra

Publication date 1989

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0726056

zbMATH Keywords

rate of convergencesteepest descent directioninexact projectionsN. Karmarkar's linear programming algorithm

Mathematics Subject Classification ID

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

Recommendations

• A modification of Karmarkar's linear programming algorithm
• scientific article; zbMATH DE number 123365
• Modification of Karmarkar's projective scaling algorithm
• Some experiments with Karmarkar's algorithm for linear programming
• Convergence in Karmarkar’s Algorithm for Linear Programming

Cited in

(9)

• A Collinear Scaling Interpretation of Karmarkar’s Linear Programming Algorithm
• A primal-dual potential reduction method for problems involving matrix inequalities
• scientific article; zbMATH DE number 123365 (Why is no real title available?)
• A primal projective interior point method for linear programming
• A Fourth bibliography of fractional programming
• Karmarkar's algorithm with improved steps
• A relaxed version of Karmarkar's method
• A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
• On finding a vertex solution using interior point methods

This page was built for publication: A Self-Correcting Version of Karmarkar’s Algorithm

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