scientific article; zbMATH DE number 556487

MaRDI QIDQ4288947zbMATH OpenFDO

Authors M. J. D. Powell

Publication date 28 March 1995

zbMATH Keywords

complexityKarmarkar's algorithmlinear programminglog barrier versionnumber of iterationsnumerical example

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05)

Recommendations

• On the number of iterations of Karmarkar's algorithm for linear programming
• scientific article; zbMATH DE number 4170639
• Convergence in Karmarkar’s Algorithm for Linear Programming
• A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations

Cited in

(8)

• On the number of iterations of Karmarkar's algorithm for linear programming
• Interior-point algorithms for semi-infinite programming
• scientific article; zbMATH DE number 4170639 (Why is no real title available?)
• Convergence in Karmarkar’s Algorithm for Linear Programming
• scientific article; zbMATH DE number 650970 (Why is no real title available?)
• scientific article; zbMATH DE number 892328 (Why is no real title available?)
• scientific article; zbMATH DE number 892376 (Why is no real title available?)
• Towards an asymptotic analysis of Karmarkar's algorithm

This page was built for publication:

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