On the resolution of the generalized nonlinear complementarity problem

Review text

Some new techniques are presented to solve the generalized nonlinear complementarity problem defined on a polyhedral cone. These techniques are explained through many numerical experiments.NEWLINENEWLINENEWLINEThe paper will be very much useful to many researchers working on nonlinear complementarity problem. The authors have made great efforts to propose fascinating and promising techniques to solve nonlinear complementarity problems.

Recommendations

Cited in

(34)

Global error bound for the generalized linear complementarity problem over a polyhedral cone
On the solution and complexity of a generalized linear complementarity problem
Smoothing Newton method for generalized complementarity problems based on a new smoothing function
A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems
An improvement of global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
A smoothing inexact Newton method for generalized nonlinear complementarity problem
A sharper global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
Generalized polynomial complementarity problems over a polyhedral cone
A smoothing Newton-type method for generalized nonlinear complementarity problem
Box-constrained minimization reformulations of complementarity problems in second-order cones
A new system of generalized nonlinear co-complementarity problems
A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
A generalized nonlinear complementarity problems
Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities
Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method
Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem
Generalized tensor complementarity problems over a polyhedral cone
On the Nonlinear Generalized Ordered Complementarity Problem
A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints
Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem
A projected-gradient interior-point algorithm for complementarity problems
On the natural merit function for solving complementarity problems
Mixed Nonlinear Complementarity Problems via Nonlinear Optimization: Numerical Results on Multi-Rigid-Body Contact Problems with Friction
Global error bound estimates algorithm for an R₀-type generalized LCP over polyhedral cone and its applications
A Levenberg-Marquardt type algorithm with a Broyden-like update technique for solving nonlinear equations
A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
Analysis of the inexact modified Levenberg-Marquardt method for nonlinear equations
The modified Levenberg-Marquardt method incorporating a new LM parameter and a nonmonotone scheme
A projection algorithm for general variational inequalities with perturbed constraint sets

Describes a project that uses

Uses Software