Weighted linear complementarity problem;
Interior-point methods;
New search direction;
Polynomial complexity;
ALGORITHM;
D O I:
10.1007/s10957-022-02139-3
中图分类号:
C93 [管理学];
O22 [运筹学];
学科分类号:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要:
In this paper, we present a full-Newton step interior-point method for solving monotone Weighted Linear Complementarity Problem. We use the technique of algebraic equivalent transformation (AET) of the nonlinear equation of the system which defines the central path. The AET is based on the square root function which plays an important role in computing the new search directions. The algorithm uses only full-Newton steps at each iteration, and hence, line searches are no longer needed. We prove that the algorithm has a quadratic rate of convergence to the target point on the central path. The obtained iteration bound coincides with the best known iteration bound for these types of problems.
机构:
Xidian Univ, Sch Math & Stat, Xian, Peoples R China
Xian Technol Univ, Sch Sci, Xian, Peoples R ChinaXidian Univ, Sch Math & Stat, Xian, Peoples R China
Wang, Weiwei
Bi, Hongmei
论文数: 0引用数: 0
h-index: 0
机构:
Air Force Engn Univ, Sch Sci, Xian, Peoples R ChinaXidian Univ, Sch Math & Stat, Xian, Peoples R China