A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems

Abstract: In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is produced by suitable perturbation in HLCP problem. Then, we use so-called feasibility steps that serves to generate strictly feasible iterates for the next perturbed problem. After accomplishing a few centering steps for the new perturbed problem, we obtain strictly feasible iterates close enough to the central path of the new perturbed problem. The complexity of the algorithm coincides with the best known iteration complexity for infeasible interior-point methods. Keywords: Horizontal linear complementarity problem (HLCP), infeasible-interior-point method, central path. MSC: 90C33, 90C51

[1]  Stephen J. Wright,et al.  Primal-Dual Interior-Point Methods , 1997 .

[2]  Hossein Mansouri,et al.  A full-Newton step O(n) infeasible-interior-point algorithm for linear complementarity problems , 2011 .

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

[4]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[5]  Hossein Mansouri,et al.  Polynomial interior-point algorithm for P*${(\kappa)}$ horizontal linear complementarity problems , 2012, Numerical Algorithms.

[6]  Shinji Mizuno,et al.  High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems , 1998, Math. Oper. Res..

[7]  M. Anitescu,et al.  Equivalence Between Different Formulations of the Linear Complementarity Problem , 1997 .

[8]  Hossein Mansouri,et al.  A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization , 2009, Numerical Algorithms.

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

[10]  Josef Stoer,et al.  The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems , 1998 .

[11]  H. Mansouri,et al.  A Quadratically Convergent ( ) O n Interior-Point Algorithm for the P * ( κ )-Matrix Horizontal Linear Complementarity Problem , 2012 .

[12]  Cosmin G. Petra,et al.  Corrector-predictor methods for sufficient linear complementarity problems , 2011, Comput. Optim. Appl..

[13]  Shuzhong Zhang,et al.  iteration primal-dual path-following method , based on wide neighborhoods and large updates , for monotone linear complementarity problems , 2004 .

[14]  Josef Stoer,et al.  Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity , 1998, Math. Program..

[15]  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..

[16]  J. Frédéric Bonnans,et al.  Fast convergence of the simplified largest step path following algorithm , 1996, Math. Program..