Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities

DOI10.1080/02331934.2016.1244268MaRDI QIDQ4598852zbMATH OpenOpenAlexFDO

Authors Alexander Engau, Miguel F. Anjos

Publication date 15 December 2017

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/85926627/Convergence_and_Polynomiality_of_a_Primal_Dual_Interior_Point_Algorithm_for_Linear_Programming_with_Selective_Addition_of_Inequalities.pdf

zbMATH Keywords

interior-point algorithmslinear programmingselective addition of inequalities

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Combining phase I and phase II in a potential reduction algorithm for linear programming
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones

This page was built for publication: Convergence and polynomiality of primal-dual interior-point algorithms for linear programming with selective addition of inequalities

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