The nonlinear complementarity problem (denoted by NCP(F)) can be reformulated as the solution of a nonsmooth system of equations. By introducing a new smoothing NCP-function, the problem is approximated by a family of parameterized smooth equations. A one-step smoothing Newton method is proposed for
A regularization semismooth Newton method based on the generalized Fischer–Burmeister function for -NCPs
✍ Scribed by Jein-Shan Chen; Shaohua Pan
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 237 KB
- Volume
- 220
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
We consider a regularization method for nonlinear complementarity problems with F being a P 0 -function which replaces the original problem with a sequence of the regularized complementarity problems. In this paper, this sequence of regularized complementarity problems are solved approximately by applying the generalized Newton method for an equivalent augmented system of equations, constructed by the generalized Fischer-Burmeister (FB) NCP-functions p with p > 1. We test the performance of the regularization semismooth Newton method based on the family of NCP-functions through solving all test problems from MCPLIB. Numerical experiments indicate that the method associated with a smaller p, for example p ∈ [1.1, 2], usually has better numerical performance, and the generalized FB functions p with p ∈ [1.1, 2) can be used as the substitutions for the FB function 2 .
📜 SIMILAR VOLUMES
In this paper, we present a new one-step smoothing Newton method proposed for solving the non-linear complementarity problem with P 0 -function based on a new smoothing NCP-function. We adopt a variant merit function. Our algorithm needs only to solve one linear system of equations and perform one l
the paper [J.-S. Chen, S. Pan, A family of NCP-functions and a descent method for the nonlinear complementarity problem, Computational Optimization and Applications, 40 (2008) 389-404], the authors proposed a derivative-free descent algorithm for nonlinear complementarity problems (NCPs) by the gene