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...

Full description

Saved in:

Bibliographic Details
Published in:	Optimization methods & software Vol. 24; no. 3; pp. 447 - 460
Main Authors:	Hu, Sheng-Long, Huang, Zheng-Hai, Wang, Ping
Format:	Journal Article
Language:	English
Published:	Taylor & Francis 01.06.2009
Subjects:	global convergence line search local superlinear convergence nonlinear complementarity problem smoothing-type algorithm
ISSN:	1055-6788, 1029-4937
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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