A primal—dual infeasible-interior-point algorithm for linear programming

As in many primal—dual interior-point algorithms, a primal—dual infeasible-interior-point algorithm chooses a new point along the Newton direction towards a point on the central trajectory, but it does not confine the iterates within the feasible region. This paper proposes a step length rule with which the algorithm takes large distinct step lengths in the primal and dual spaces and enjoys the global convergence.

[1]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[2]  Kunio Tanabe,et al.  Centered newton method for mathematical programming , 1988 .

[3]  M. Kojima,et al.  A primal-dual interior point algorithm for linear programming , 1988 .

[4]  Shinji Mizuno,et al.  A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..

[5]  Clyde L. Monma,et al.  An Implementation of a Primal-Dual Interior Point Method for Linear Programming , 1989, INFORMS J. Comput..

[6]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[7]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..

[8]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[9]  I. Lustig,et al.  Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick! , 1990 .

[10]  Clyde L. Monma,et al.  Further Development of a Primal-Dual Interior Point Method , 1990, INFORMS J. Comput..

[11]  Y. Ye,et al.  On some efficient interior point methods for nonlinear convex programming , 1991 .

[12]  野間 俊人.  A globally convergent iterative algorithm for complementarity problems : a modification of interior point algorithms for linear complementarity problems , 1991 .

[13]  Nimrod Megiddo,et al.  Homotopy Continuation Methods for Nonlinear Complementarity Problems , 1991, Math. Oper. Res..

[14]  Irvin Lustig,et al.  Feasibility issues in a primal-dual interior-point method for linear programming , 1990, Math. Program..

[15]  I. Lustig,et al.  Computational experience with a primal-dual interior point method for linear programming , 1991 .

[16]  Nimrod Megiddo,et al.  A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.

[17]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[18]  Shinji Mizuno,et al.  A General Framework of Continuation Methods for Complementarity Problems , 1993, Math. Oper. Res..

[19]  John M. Mulvey,et al.  Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives , 1993, SIAM J. Optim..

[20]  Robert J. Vanderbei,et al.  Symmetric indefinite systems for interior point methods , 1993, Math. Program..

[21]  Shinji Mizuno,et al.  On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..

[22]  Shinji Mizuno,et al.  A little theorem of the bigℳ in interior point algorithms , 1993, Math. Program..

[23]  Yin Zhang,et al.  A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..