Computational experience with a modified potential reduction algorithm for linear programming

Sanjay Mehrotra*, Kuo Ling Huang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


We study the performance of a homogeneous and self-dual interior point solver for linear programming (LP) that is equipped with a continuously differentiable potential function. Our work is motivated by the apparent gap between the theoretical complexity results and long-step practical implementations in interior point algorithms. The potential function described here ensures a global linear polynomial-time convergence while providing the flexibility to integrate heuristics for generating the search directions and step length computations. Computational results on standard test problems show that LP problems are solved as efficiently (in terms of the number of iterations) as Mosek6.

Original languageEnglish (US)
Pages (from-to)865-891
Number of pages27
JournalOptimization Methods and Software
Issue number4-5
StatePublished - Oct 1 2012


  • homogeneous and self-dual model
  • interior point methods
  • linear programming

ASJC Scopus subject areas

  • Software
  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'Computational experience with a modified potential reduction algorithm for linear programming'. Together they form a unique fingerprint.

Cite this