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

DOI10.1007/S101070050091MaRDI QIDQ1961981zbMATH OpenOpenAlexFDO

Authors 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)

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
• scientific article; zbMATH DE number 4197744
• Potential-reduction methods in mathematical programming

Cited in

(5)

• A class of infeasible interior point algorithms for convex quadratic programming
• Computational experience with a modified potential reduction algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• The complexity of self-regular proximity based infeasible IPMs

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)