A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming, which is an extension of the work of Roos (SIAM J. Optim. 16(4):1110–1136, 2006). The main iteration of the algorithm consists of a feasibility step and several centrality steps. We introduce a kernel function in the algorithm to induce the feasibility step. For parameter p∈[0,1], the polynomial complexity can be proved and the result coincides with the best result for infeasible interior-point methods, that is, O(nlog n/ε).

[1]  Kees Roos,et al.  A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier , 2002, SIAM J. Optim..

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

[3]  Keyvan Amini,et al.  AN INTERIOR POINT METHOD FOR LINEAR PROGRAMMING BASED ON A CLASS OF KERNEL FUNCTIONS , 2005 .

[4]  Tamás Terlaky,et al.  New complexity analysis of IIPMs for linear optimization based on a specific self-regular function , 2008, Eur. J. Oper. Res..

[5]  C. Roos,et al.  An Infeasible Interior-Point Algorithm with full-Newton Step for Linear Optimization , 2008 .

[6]  Kees Roos,et al.  A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization , 2004, SIAM J. Optim..

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

[8]  Jiming Peng,et al.  Self-regular functions and new search directions for linear and semidefinite optimization , 2002, Math. Program..

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

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

[11]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.