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

DOI10.1007/s101070050091zbMath0946.90048OpenAlexW2009333721MaRDI QIDQ1961981

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 functionsself-dualinfeasible-interior-point methods

Mathematics Subject Classification ID

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

Related Items (3)

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

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