A generalized direction in interior point method for monotone linear complementarity problems

被引:8
|
作者
Haddou, Mounir [1 ]
Migot, Tangi [1 ]
Omer, Jeremy [1 ]
机构
[1] Univ Rennes, INSA Rennes, CNRS, IRMAR,UMR 6625, F-35000 Rennes, France
关键词
Concave functions; Interior-point methods; Linear programming; Linear complementarity problems; Polynomial time complexity; CARTESIAN PRODUCT; ALGORITHM;
D O I
10.1007/s11590-018-1241-2
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we present a new interior point method with full Newton step for monotone linear complementarity problems. The specificity of our method is to compute the Newton step using a modified system similar to that introduced by Darvay in Stud Univ Babe-Bolyai Ser Inform 47:15-26,2017. We prove that this new method possesses the best known upper bound complexity for these methods. Moreover, we extend results known in the literature since we consider a general family of smooth concave functions in the Newton system instead of the square root.
引用
收藏
页码:35 / 53
页数:19
相关论文
共 50 条