A kernel function based Interior-Point Methods for solving P (*)(kappa)-linear complementarity problem

作者：Peyghami M Reza^*; Amini Keyvan

来源：Acta Mathematica Sinica-English Series, 2010, 26(9): 1761-1778.

DOI：10.1007/s10114-010-7529-5

• Linear complementarity problem
• interior-point methods
• large and small update methods
• polynomial complexity

In this paper, motivated by the complexity results of Interior Point Methods (IPMs) for Linear Optimization (LO) based on kernel functions, we present a polynomial time IPM for solving P (*)(kappa)-linear complementarity problem, using a new class of kernel functions. The special case of our new class was considered earlier for LO by Y. Q. Bai et al. in 2004. Using some appealing properties of the new class, we show that the iteration bound for IPMs matches the so far best known theoretical iteration bound for both large and small updates by choosing special values for the parameters of the new class.

• 出版日期2010-9