A full-Newton step non-interior continuation algorithm for a class of complementarity problems

作者:

Highlights:

摘要

In this paper, we investigate a class of nonlinear complementarity problems arising from the discretization of the free boundary problem, which was recently studied by Sun and Zeng [Z. Sun, J. Zeng, A monotone semismooth Newton type method for a class of complementarity problems, J. Comput. Appl. Math. 235 (5) (2011) 1261–1274]. We propose a new non-interior continuation algorithm for solving this class of problems, where the full-Newton step is used in each iteration. We show that the algorithm is globally convergent, where the iteration sequence of the variable converges monotonically. We also prove that the algorithm is globally linearly and locally superlinearly convergent without any additional assumption, and locally quadratically convergent under suitable assumptions. The preliminary numerical results demonstrate the effectiveness of the proposed algorithm.

论文关键词:90C33,65K05,65H05,M-matrix,Monotonically iterative sequence,Non-interior continuation algorithm,Global convergence,Local quadratic convergence

论文评审过程:Received 21 May 2011, Revised 28 October 2011, Available online 20 January 2012.

论文官网地址:https://doi.org/10.1016/j.cam.2012.01.016