A predictor-corrector infeasible-interior-point algorithm for linear programming

DOI10.1016/0167-6377(94)90061-2zbMath0820.90070OpenAlexW2065878167MaRDI QIDQ1342276

Shinji Mizuno

Publication date: 11 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90061-2

zbMATH Keywords

duality gappredictor-corrector algorithmfeasible-interior-point algorithmproof of polynomiality

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Computational experience with a primal-dual interior point method for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
• On the Implementation of a Primal-Dual Interior Point Method
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming