Insights into the interior-point methods |
| |
Authors: | R -L Sheu S -C Fang |
| |
Institution: | (1) Operations Research Program, North Carolina State University, Box 7913, 27695-7913 Raleigh, NC |
| |
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.This work is partially supported by the North Carolina Supercomputing Center 1990 Cray Grant Program sponsored by Cray Research. |
| |
Keywords: | Linear Programming Interior-Point Method Newton Method Barrier Function Method Entropy Optimization |
本文献已被 SpringerLink 等数据库收录! |
|