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

被引：0
作者：
M. Pirhaji
M. Zangiabadi
H. Mansouri
机构：
[1] Shahrekord University,Department of Applied Mathematics, Faculty of Mathematical Sciences
来源：
Journal of Applied Mathematics and Computing | 2017年 / 54卷
关键词：
Monotone linear complementarity problem; Infeasible interior-point methods; Kernel function; Complexity analysis; 90C51; 90C33;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：14
相关论文
共 37 条
[1]  
Bai YQ(2005)A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization SIAM J. Optim. 15 101-128
[2]  
El Ghami M(2014)A full-Newton step infeasible interior-point algorithm for J. Syst. Sci. Complex. 27 1027-1044
[3]  
Roos C(2012)-linear complementarity problems J. Comput. Appl. Math. 236 3613-3623
[4]  
Danhua Z(2013)Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term Optim. Theory Decis. Mak. Oper. Res. Appl. 31 331-349
[5]  
Mingwang Z(2015)Primal dual interior-point methods for J. Appl. Math. Comput. 48 111-128
[6]  
El Ghami M(1979)-linear complementarity problem based on a kernel function with a trigonometric barrier term Math. Program 17 335-344
[7]  
Guennoun ZA(2013)An interior-point method for Algorithmic Oper. Res. 7 103-110
[8]  
Bouali S(2015)-linear complementarity problem based on a trigonometric kernel function Yugosl. J. Oper. Res. 25 233-250
[9]  
Steihaug T(1989)Computational complexity of LCPs associated with positive definite matrices Math. Program. 44 1-26
[10]  
El Ghami M(2009)A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function J. Shanghai Univ. 13 95-101
1234