A semismooth equation approach to the solution of nonlinear complementarity problems
Mathematical Programming: Series A and B
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems
Computational Optimization and Applications
A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
SIAM Journal on Optimization
SC1 optimization reformulations of the generalized Nash equilibrium problem
Optimization Methods & Software
Computational Optimization and Applications
Some projection-like methods for the generalized Nash equilibria
Computational Optimization and Applications
Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
SIAM Journal on Optimization
Computational Optimization and Applications
Mathematical Programming: Series A and B
On generalized Nash games and variational inequalities
Operations Research Letters
Operations Research Letters
A numerical algorithm for finding solutions of a generalized Nash equilibrium problem
Computational Optimization and Applications
Hi-index | 0.00 |
The generalized Nash equilibrium is a Nash game, where not only the players' cost functions, but also the constraints of a player depend on the rival players decisions. We present a globally convergent algorithm that is suited for the computation of a normalized Nash equilibrium in the generalized Nash game with jointly convex constraints. The main tool is the regularized Nikaido---Isoda function as a basis for a locally convergent nonsmooth Newton method and, in another way, for the definition of a merit function for globalization. We conclude with some numerical results.