A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming

We define a surface of analytic centers determined by a primal-dual pair of linear programming problems and an infeasible interior point. Then we study the boundary of the surface by analyzing limiting behavior of paths on the surface and sequences in a neighborhood of the surface. We introduce generic primal-dual infeasible-interior-point algorithms in which the search direction is the Newton direction for a system defining a point on the surface. We show that feasible-interior-point algorithms for artificial self-dual problems and for an artificial primal-dual pair of linear programming problems can he considered as special cases of these infeasible-interior-point algorithms or simple variants of them. In this sense, there are O ((sqrt) nL )-iteration primal-dual infeasible-interior-point algorithms for linear programming.

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

[2]  R. C. Monteiro,et al.  Interior path following primal-dual algorithms , 1988 .

[3]  Shinji Mizuno,et al.  A primal—dual infeasible-interior-point algorithm for linear programming , 1993, Math. Program..

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

[5]  Renato D. C. Monteiro,et al.  Limiting behavior of the affine scaling continuous trajectories for linear programming problems , 1991, Math. Program..

[6]  Yin Zhang,et al.  Superlinear convergence of infeasible-interior-point methods for linear programming , 1994, Math. Program..

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

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

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

[10]  Shinji Mizuno,et al.  Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming , 1995, SIAM J. Optim..

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

[12]  D. Bayer,et al.  The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .

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

[14]  L. McLinden.  An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem. , 1980 .

[15]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[16]  Shinji Mizuno,et al.  Polynomiality of infeasible-interior-point algorithms for linear programming , 1994, Math. Program..

[17]  Florian A. Potra,et al.  An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming , 1996, SIAM J. Optim..

[18]  Shinji Mizuno,et al.  Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems , 1990, Math. Oper. Res..

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

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