A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems

The smoothing-type algorithm has been a powerful tool for solving various optimization problems. In order to improve the numerical results of the algorithm, the nonmonotone line search technique has been used when the algorithm is implemented. However, the theoretical analysis is based on the algori...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Optimization methods & software Ročník 24; číslo 3; s. 447 - 460
Hlavní autoři:	Hu, Sheng-Long, Huang, Zheng-Hai, Wang, Ping
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Taylor & Francis 01.06.2009
Témata:	global convergence line search local superlinear convergence nonlinear complementarity problem smoothing-type algorithm
ISSN:	1055-6788, 1029-4937
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	The smoothing-type algorithm has been a powerful tool for solving various optimization problems. In order to improve the numerical results of the algorithm, the nonmonotone line search technique has been used when the algorithm is implemented. However, the theoretical analysis is based on the algorithm with some monotone line search. In this paper, based on the smoothed Kanzow-Kleinmichel NCP function, we propose a smoothing Newton algorithm for solving the nonlinear complementarity problem with a new nonmonotone line search. We show that the nonmonotone algorithm is globally and locally superlinearly convergent under suitable assumptions. The preliminary numerical results are also reported.
ISSN:	1055-6788 1029-4937
DOI:	10.1080/10556780902769862