An interior point approach for linear complementarity problem using new parametrized kernel function

被引:0
|
作者
Benhadid, Ayache [1 ]
Saoudi, Khaled [1 ]
Merahi, Fateh [1 ]
机构
[1] Abbes Laghrour Univ, Fac Sci & Technol, Dept Math & Comp Sci, Khenchela, Algeria
关键词
Linear optimization; kernel function; interior-point methods; complexity bound; ALGORITHMS;
D O I
10.1080/02331934.2021.1945051
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we propose a primal-dual interior point method for Linear Complementarity Problem (LCP) based on a new parameterized kernel function. The investigation according to it yields the best-known iteration bound O(root n log(n) log(n/epsilon)) for large-update algorithm and thus improves the iteration bound obtained in Bai et al. (SIAM J Optim. 2004;15:101-128) for large-update algorithm. Finally, we present few numerical results to demonstrate the efficiency of the proposed algorithm.
引用
收藏
页码:4403 / 4422
页数:20
相关论文
共 50 条