Abstract
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.
Similar content being viewed by others
References
Adler I, Karmarkar N, Resende MGC, Veiga G (1986) An Implementation of Karmarkar's Algorithm for Linear Programming. Working paper, Operations Research Center, University of California, Berkeley, California
Barnes ER (1986) A Variation on Karmarkar's Algorithm for Solving Linear Programming Problems. Mathematical Programming 36:174–182
Fang S-C (1990) A New Unconstrained Convex Programming Approach to Linear Programming. OR Report No 243, North Carolina State University
Gill PE, Murray W (1974) Numerical Methods for Constrained Optimization. Academic Press, London
Gill PE, Murray W, Saunders MA, Tomlin JA, Wright MH (1986) On Projected Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method. Mathematical Programming 36:183–209
Gonzaga C (1987) An Algorithm for Solving Linear Programming Problems inO(n 3L) Operations. Memorandum # UCB/ERLM87/10. Electronics Laboratory, College of Engineering, University of California, Berkeley
Karmarkar N (1984) A New Polynomial Time Algorithm for Linear Programming. Combinatorica 4:373–395
Kojima M, Mizuno S, Yoshise A (1987) A Primal-dual Interior Point Method for Linear Programming. Research Report B-188. Department of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan
Megiddo N (1986) Pathways to the Optimal Set of Linear Programming. IBM Research Report RJ 5295, IBM Almaden Research Center, San Jose, California
Megiddo N (1989) Progress in Mathematical Programming: Interior-Point and Related Methods. Springer, New York
Monteiro RC, Adler I (1987) AnO(n 3L) Primal-dual Interior Point Algorithm for Linear Programming. Manuscript, Department of IE & OR, University of California, Berkeley, California. To appear in Mathematical Programming
Nazareth JL (1989) Pricing Criteria in Linear Programming. In: Progress in Mathematical Programming: Interior-Point and Related Methods. Springer, New York
Nomizu K (1966) Fundamentals of Linear Algebra. McGraw-Hill, New Jersey
Shanno DF, Bagchi A (1988) A Unified View of Interior Point Methods for Linear Programming. Rutcor Research Report # 35-88
Pshenichny BN, Danilin YM (1978) Numerical Methods in Extremal Problems. Mir Publishers, Moscow
Vanderbei RJ, Meketon MS, Freeman BA (1986) A Modification of Karmarkar's Linear Programming Algorithm. Algorithmica 1:395–407
Ye Y (1989) An Extension of Karmarkar's Algorithm of the Trust Region Method for Quadratic Programming. In: Progress in Mathematical Programming: Interior-Point and Related Methods. Springer, New York
Author information
Authors and Affiliations
Additional information
This work is partially supported by the North Carolina Supercomputing Center 1990 Cray Grant Program sponsored by Cray Research.
Rights and permissions
About this article
Cite this article
Sheu, R.L., Fang, S.C. Insights into the interior-point methods. ZOR - Methods and Models of Operations Research 36, 227–257 (1992). https://doi.org/10.1007/BF01415890
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01415890