Skip to main content
Log in

A Regularization Newton Method for Solving Nonlinear Complementarity Problems

  • Published:
Applied Mathematics and Optimization Aims and scope Submit manuscript

Abstract.

In this paper we construct a regularization Newton method for solving the nonlinear complementarity problem (NCP(F )) and analyze its convergence properties under the assumption that F is a P 0 -function. We prove that every accumulation point of the sequence of iterates is a solution of NCP(F ) and that the sequence of iterates is bounded if the solution set of NCP(F ) is nonempty and bounded. Moreover, if F is a monotone and Lipschitz continuous function, we prove that the sequence of iterates is bounded if and only if the solution set of NCP(F ) is nonempty by setting \(t=\frac{1}{2}\) , where \(t\in [\frac{1}{2},1]\) is a parameter. If NCP(F) has a locally unique solution and satisfies a nonsingularity condition, then the convergence rate is superlinear (quadratic) without strict complementarity conditions. At each step, we only solve a linear system of equations. Numerical results are provided and further applications to other problems are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Author information

Authors and Affiliations

Authors

Additional information

Accepted 25 March 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, D. A Regularization Newton Method for Solving Nonlinear Complementarity Problems . Appl Math Optim 40, 315–339 (1999). https://doi.org/10.1007/s002459900128

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002459900128

Navigation