عنوان An infeasible interior-point method for the P(k)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step نوع پژوهش مقاله چاپ شده کلیدواژهها Linear complementarity problem, Full-Newton step, Infeasible interiorpoint method, Kernel function, Polynomial complexity چکیده An infeasible interior-point algorithm for solving the P(k)-matrix linear complementarity problem based on a kernel function with trigonometric barrier term is analyzed. Each (main) iteration of the algorithm consists of a feasibility step and several centrality steps, whose feasibility step is induced by a trigonometric kernel function. The complexity result coincides with the best result for infeasible interiorpoint methods for P(k)-matrix linear complementarity problem. پژوهشگران بهروز خیرفام (نفر اول)، معصومه حقیقی (نفر دوم)