DocumentCode :
3040314
Title :
A non-interior-point smoothing algorithm for the nonlinear complementarity problem with a P* function
Author :
Liu, Danhong ; Huang, Tao
Author_Institution :
Tianjin Univ., Tianjin, China
fYear :
2011
fDate :
26-28 July 2011
Firstpage :
5711
Lastpage :
5714
Abstract :
A smoothing function is used to reformulate the P* nonlinear complementarity problem (P* NCP) as a parameterized smooth equation which can be solved by a non-interior-point smoothing method. Under an assumption that the P* NCP has a nonempty solution set, the proposed algorithm is proved to be globally convergent and the iteration sequence generated by the proposed algorithm is bounded. Furthermore, this assumption is weaker than the ones used in most existing smoothing algorithms. Without any additional assumption, the solution obtained by the proposed algorithm is shown to be a maximally complementary solution of the P* NCP.
Keywords :
convergence of numerical methods; iterative methods; set theory; vectors; P* NCP; P* function; globally convergent algorithm; globally iteration sequence; nonempty solution set; noninterior-point smoothing algorithm; nonlinear complementarity problem; smoothing function; Algorithm design and analysis; Convergence; Equations; Indexes; Jacobian matrices; Prediction algorithms; Smoothing methods; maximally complementary solution; non-interior-point smoothing algorithm; nonlinear complementarity problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multimedia Technology (ICMT), 2011 International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-61284-771-9
Type :
conf
DOI :
10.1109/ICMT.2011.6002577
Filename :
6002577
Link To Document :
بازگشت