Probabilistic bounds on one step objective/potential function improvement in Karmarkar's algorithm

DOI10.1051/RO/1994280403291MaRDI QIDQ4887130zbMATH OpenOpenAlexFDO

Authors Michel Minoux

Publication date 1994

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105088

zbMATH Keywords

interior point methodsworst case analysisprobabilistic analysisKarmarkar's algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Towards an asymptotic analysis of Karmarkar's algorithm
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• The Worst-Case Step in Karmarkar's Algorithm
• On the number of iterations of Karmarkar's algorithm for linear programming
• scientific article; zbMATH DE number 975789

Cited in

(1)

• Lower bounds of success probabilities for high-fidelity approach in KLM scheme

This page was built for publication: Probabilistic bounds on one step objective/potential function improvement in Karmarkar's algorithm

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