Computation of generalized differentials in nonlinear complementarity problems

Computation of generalized differentials in nonlinear complementarity problems

0.00 Avg rating0 Votes
Article ID: iaor20119935
Volume: 50
Issue: 2
Start Page Number: 403
End Page Number: 423
Publication Date: Oct 2011
Journal: Computational Optimization and Applications
Authors: ,
Keywords: optimization
Abstract:

Let f and g be continuously differentiable functions on R n . The nonlinear complementarity problem NCP(f,g), 0≤f(x)⊥g(x)≥0, arises in many applications including discrete Hamilton‐Jacobi‐Bellman equations and nonsmooth Dirichlet problems. A popular method to find a solution of the NCP(f,g) is the generalized Newton method which solves an equivalent system of nonsmooth equations F(x)=0 derived by an NCP function. In this paper, we present a sufficient and necessary condition for F to be Fréchet differentiable, when F is defined by the ‘min’ NCP function, the Fischer‐Burmeister NCP function or the penalized Fischer‐Burmeister NCP function. Moreover, we give an explicit formula of an element in the Clarke generalized Jacobian of F defined by the ‘min’ NCP function, and the B‐differential of F defined by other two NCP functions. The explicit formulas for generalized differentials of F lead to sharper global error bounds for the NCP(f,g).

Reviews

Required fields are marked *. Your email address will not be published.