An infeasible-interior-point potential-reduction algorithm for linear programming

DOI10.1007/S101070050091zbMATH Open0946.90048OpenAlexW2009333721MaRDI QIDQ1961981FDOQ1961981

Reha H. Tütüncü

Publication date: 30 January 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/9018

zbMATH Keywords

linear programminghomogeneitypotential functionsinfeasible-interior-point methodsself-dual

Mathematics Subject Classification ID

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

Cited In (4)

• A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming
• The complexity of self-regular proximity based infeasible IPMs
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Computational experience with a modified potential reduction algorithm for linear programming

   Recommendations

• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming 👍 👎
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming 👍 👎
• Polynomiality of infeasible-interior-point algorithms for linear programming 👍 👎
• Title not available (Why is that?) 👍 👎
• Potential-reduction methods in mathematical programming 👍 👎

This page was built for publication: An infeasible-interior-point potential-reduction algorithm for linear programming

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