A Nonsmooth L-M Method for Solving the Generalized Nonlinear Complementarity Problem over a Polyhedral Cone
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
In this paper the generalized nonlinear complementarity problem (GNCP) defined on a polyhedral cone is reformulated as a system of nonsmooth equations. Based on this reformulation, the famous Levenberg-Marquardt (L-M) algorithm is employed to obtain its solution. Theoretical results that relate the stationary points of the merit function to the solution of the GNCP are presented. Under mild assumptions, we show that the L-M algorithm is both globally and superlinearly convergent. Moreover, a method to calculate a generalized Jacobian is given and numerical experimental results are presented.
- A Nonsmooth L-M Method for Solving the Generalized Nonlinear Complementarity Problem over a Polyhedral Cone
Applied Mathematics and Optimization
Volume 52, Issue 1 , pp 73-92
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Stationary point
- Superlinear convergence