DocumentCode
551610
Title
A new P∗ (κ) nonlinear complementarity problem based on kernel function
Author
Gong, Xiaoyu ; Wang, Xianjia
Author_Institution
Dept. of Math., Guangdong Univ. of Petrochem. Technol., Maoming, China
Volume
1
fYear
2011
fDate
25-28 July 2011
Firstpage
126
Lastpage
130
Abstract
A new primal-dual interior-point algorithm for P*(κ) nonlinear complementarity problems is proposed. New search directions and proximity functions are proposed based on a simple kernel function which is neither a logarithmic barrier nor a self-regular function. We show that if a strictly feasible starting point is available, then the algorithm have the favorable polynomial complexity.
Keywords
Jacobian matrices; computational complexity; kernel function; nonlinear complementarity problem; polynomial complexity; primal-dual interior-point algorithm; proximity function; Algorithm design and analysis; Complexity theory; Convex functions; Kernel; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Information Processing (ICICIP), 2011 2nd International Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4577-0813-8
Type
conf
DOI
10.1109/ICICIP.2011.6008213
Filename
6008213
Link To Document