Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization

We present several improvements of the full-Newton step infeasible interior-point method for linear optimization introduced by Roos (SIAM J. Optim. 16(4):1110–1136, 2006). Each main step of the method consists of a feasibility step and several centering steps. We use a more natural feasibility step, which targets the μ+-center of the next pair of perturbed problems. As for the centering steps, we apply a sharper quadratic convergence result, which leads to a slightly wider neighborhood for the feasibility steps. Moreover, the analysis is much simplified and the iteration bound is slightly better.

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

[2]  Florian A. Potra,et al.  Predictor-corrector algorithm for solvingP*(κ)-matrix LCP from arbitrary positive starting points , 1996, Math. Program..

[3]  Kees Roos,et al.  A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization , 2006, SIAM J. Optim..

[4]  Florian A. Potra,et al.  A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP , 1997, SIAM J. Optim..

[5]  S. Janson,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[6]  C. Roos,et al.  Interior Point Methods for Linear Optimization , 2005 .

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

[8]  Jun Ji,et al.  A predictor-corrector method for solving the P*(k)-matrix lcp from infeasible starting points , 1995 .

[9]  H. Mansouri,et al.  Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps , 2007, Optim. Methods Softw..

[10]  Yin Zhang,et al.  On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem , 1994, SIAM J. Optim..

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

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

[13]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .