Infeasible Interior Point Methods for Solving Linear Programs

Interior point methods that follow the primal-dual central path of a dual pair of linear programs (P 0), (D 0) require that these problems are strictly feasible. To get around this difficulty, one technique is to embed (P 0), (D 0) into a family of suitably perturbed strictly feasible linear programs (P r), (D r), r > 0

[1]  J. Stoer.  The complexity of an infeasible interior-point path-following method for the solution of linear programs , 1994 .

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

[3]  J. Stoer,et al.  Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals , 1993 .

[4]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[5]  Michael J. Todd,et al.  On Anstreicher's combined phase I—phase II projective algorithm for linear programming , 1992, Math. Program..

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

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

[8]  Kurt M. Anstreicher,et al.  A combined phase I-phase II projective algorithm for linear programming , 1989, Math. Program..

[9]  Josef Stoer,et al.  On the complexity of following the central path of linear programs by linear extrapolation II , 1991, Math. Program..

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

[11]  Shinji Mizuno,et al.  A Surface of Analytic Centers and Infeasible- Interior-Point Algorithms for Linear Programming , 1993 .

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

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

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

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