Improving complexity of Karmarkar's approach for linear programming

MaRDI QIDQ2794254zbMATH OpenFDO

Authors Djamel Benterki, Mousaab Bouafia

Publication date 17 March 2016

Published in Revue d'Analyse Numérique et de Théorie de l'Approximation (Search for Journal in Brave)

zbMATH Keywords

interior point methodlinear programmingpotential function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• scientific article; zbMATH DE number 1135749
• An improving procedure of the interior projective method for linear programming
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• On the improvement per iteration in Karmarkar's algorithm for linear programming
• Short Steps with Karmarkar’s Projective Algorithm for Linear Programming

Cited in

(6)

• Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
• Updating lower bounds when using Karmarkar's projective algorithm for linear programming
• A new efficient short-step projective interior point method for linear programming
• A new efficient step-size in Karmarkar's projective interior point method for optimization problems
• On the improvement per iteration in Karmarkar's algorithm for linear programming
• An improving procedure of the interior projective method for linear programming

This page was built for publication: Improving complexity of Karmarkar's approach for linear programming

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