Insights into the interior-point methods

Ruey-Lin Sheu, S. C. Fang

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


In this paper, we study the search directions of three important interior-point algorithms, namely, the primal-affine scaling method (with logarithmic barrier function), the dual-affine scaling method (with logarithmic barrier function), and the primal-dual interior point method. From an algebraic point of view, we show that the search directions of these three algorithms are merely Newton directions along three different "paths" that lead to a solution of the Karush-Kuhn-Tucker conditions of a given linear programming problem. From a geometric point of view, we show that these directions can be obtained by solving certain well-defined subproblems. Both views provide a general platform for studying the existing interior-point methods and deriving new interior-point algorithms. We illustrate the derivation of new interior-point algorithms by replacing the logarithmic barrier function with an entropic barrier function. The results have been generalized and discussed.

Original languageEnglish
Pages (from-to)227-257
Number of pages31
JournalZOR Zeitschrift für Operations Research Methods and Models of Operations Research
Issue number3
Publication statusPublished - 1992 May 1

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Management Science and Operations Research


Dive into the research topics of 'Insights into the interior-point methods'. Together they form a unique fingerprint.

Cite this