An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function

被引：1
|
作者：
Pirhaji, M. [1 ]
Zangiabadi, M. [1 ]
Mansouri, H. [1 ]
机构：
[1] Shahrekord Univ, Fac Math Sci, Dept Appl Math, POB 115, Shahrekord, Iran
来源：
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING | 2017年 / 54卷 / 1-2期
关键词：
Monotone linear complementarity problem; Infeasible interior-point methods; Kernel function; Complexity analysis; LCP;
D O I：
10.1007/s12190-016-1019-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, a full-Newton step infeasible kernel-based interior-point algorithm for solving monotone linear complementarity problems is proposed. In each iteration, the algorithm computes the new feasibility search directions by using a specific kernel function with the trigonometric barrier term and obtains the centering search directions using the classical kernel function. The algorithm takes only full-Newton steps and therefore no line-searches are needed for generating the new iterations. The convergence of the algorithm is shown and it is proved that the iteration bound of the algorithm coincides with the currently best iteration bound for monotone linear complementarity problem.
引用
收藏
页码：469 / 483
页数：15
相关论文
共 50 条
  • [1] An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
    M. Pirhaji
    M. Zangiabadi
    H. Mansouri
    [J]. Journal of Applied Mathematics and Computing, 2017, 54 : 469 - 483
  • [2] Interior-point algorithm based on general kernel function for monotone linear complementarity problem
    刘勇
    白延琴
    [J]. Advances in Manufacturing, 2009, (02) : 95 - 101
  • [3] On the solution of the monotone and nonmonotone linear complementarity problem by an infeasible interior-point algorithm
    Judice, J
    Fernandes, L
    Lima, A
    [J]. NONLINEAR OPTIMIZATION AND APPLICATIONS, 1996, : 213 - 227
  • [4] A new interior-point algorithm for monotone horizontal linear complementarity problem
    Wang, Guoqiang
    Cai, Xinzhong
    Yue, Yujing
    [J]. PROCEEDING OF THE SEVENTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2008, 7 : 216 - 221
  • [5] An -neighborhood infeasible interior-point algorithm for linear complementarity problems
    Pirhaji, M.
    Zangiabadi, M.
    Mansouri, H.
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2017, 15 (02): : 111 - 131
  • [6] An Adaptive Infeasible Interior-Point Algorithm for Linear Complementarity Problems
    Mansouri H.
    Pirhaji M.
    [J]. Journal of the Operations Research Society of China, 2013, 1 (04) : 523 - 536
  • [7] A New Polynomial Interior-Point Algorithm for Monotone Mixed Linear Complementarity Problem
    Wang, Guoqiang
    Cai, Xinzhong
    Yue, Yujing
    [J]. ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 7, PROCEEDINGS, 2008, : 450 - 454
  • [8] A kernel function based Interior-Point Methods for solving P *(κ)-linear complementarity problem
    Peyghami, M. Reza
    Amini, Keyvan
    [J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2010, 26 (09) : 1761 - 1778
  • [9] A kernel function based Interior-Point Methods for solving P*(κ)-linear complementarity problem
    M. Reza Peyghami
    Keyvan Amini
    [J]. Acta Mathematica Sinica, English Series, 2010, 26 : 1761 - 1778
  • [10] A Kernel Function Based Interior-Point Methods for Solving P*(κ)-Linear Complementarity Problem
    M.Reza PEYGHAMI
    Keyvan AMINI
    [J]. Acta Mathematica Sinica,English Series, 2010, 26 (09) : 1761 - 1778
12345