A Self-Correcting Version of Karmarkar’s Algorithm

DOI10.1137/0726056zbMath0681.65042OpenAlexW2091964672MaRDI QIDQ4730699

Sanjay Mehrotra, Donald Goldfarb

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) Fractional programming (90C32) Linear programming (90C05)

Related Items

A relaxed version of Karmarkar's method, A primal-dual potential reduction method for problems involving matrix inequalities, A Fourth bibliography of fractional programming, On finding a vertex solution using interior point methods, A primal projective interior point method for linear programming