DocumentCode
2317782
Title
A wide-neighborhood interior-point method for P* (κ) complementarity problem
Author
Lv, Yanli ; Zhang, Mingwang
Author_Institution
Coll. of Sci., China Three Gorges Univ., Yichang, China
fYear
2010
fDate
25-27 Aug. 2010
Firstpage
506
Lastpage
510
Abstract
In this paper we propose a new potential reduction interior-point method for a kind of nonlinear nonmonotone complementarity problem-P*(κ) complementarity problem, which is based on the wide-neighborhood N∞-(β). This method is a generalization of Mizuno, Todd and Ye´s result. Although the search direction of this algorithm is the same as that of the path-following algorithm, the step size is determined as the minimum point of the potential function in the neighborhood. Therefore, the duality gap is reduced by a fixed positive constant at each step. Finally, the polynomial complexity O((2κ + 1 + max{κ, 1/4}M)nt) is attained when the problem satisfies a scaled Lipschitz condition, where t is a positive constant and M is defined in the condition.
Keywords
computational complexity; duality (mathematics); nonlinear programming; duality gap; fixed positive constant; nonlinear nonmonotone complementarity problem; path-following algorithm; polynomial complexity; potential reduction interior-point method; scaled Lipschitz condition; search direction; step size; wide-neighborhood interior-point method; Algorithm design and analysis; Complexity theory; Linear programming; Mathematical programming; Polynomials; Prediction algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computational Intelligence (IWACI), 2010 Third International Workshop on
Conference_Location
Suzhou, Jiangsu
Print_ISBN
978-1-4244-6334-3
Type
conf
DOI
10.1109/IWACI.2010.5585175
Filename
5585175
Link To Document