Rational Generalized Nash Equilibrium Problems
From MaRDI portal
Abstract: This paper studies generalized Nash equilibrium problems that are given by rational functions. The optimization problems are not assumed to be convex. Rational expressions for Lagrange multipliers and feasible extensions of KKT points are introduced to compute a generalized Nash equilibrium (GNE). We give a hierarchy of rational optimization problems to solve rational generalized Nash equilibrium problems. The existence and computation of feasible extensions are studied. The Moment-SOS relaxations are applied to solve the rational optimization problems. Under some general assumptions, we show that the proposed hierarchy can compute a GNE if it exists or detect its nonexistence. Numerical experiments are given to show the efficiency of the proposed method.
Recommendations
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- A Lagrange multiplier expression method for bilevel polynomial optimization
- ADMM-type methods for generalized Nash equilibrium problems in Hilbert spaces
- An elementary and constructive solution to Hilbert’s 17th Problem for matrices
- An improved two-step method for solving generalized Nash equilibrium problems
- An introduction to polynomial and semi-algebraic optimization
- Augmented Lagrangian methods for the solution of generalized Nash equilibrium problems
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Convex generalized Nash equilibrium problems and polynomial optimization
- Decomposition algorithms for generalized potential games
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
- Exact penalization of generalized Nash equilibrium problems
- Generalized Nash equilibrium problems
- Generalized Nash equilibrium problems and Newton methods
- Global minimization of rational functions and the nearest GCDs
- Global optimization of rational functions: a semidefinite programming approach
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Linear optimization with cones of moments and nonnegative polynomials
- Modern nonconvex nondifferentiable optimization
- Nash equilibria: the variational approach
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
- Nonconvex games with side constraints
- Nonlinear programming
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- On generalized Nash games and variational inequalities
- On representations of the feasible set in convex optimization
- On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- Optimization of Polynomials on Compact Semialgebraic Sets
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
- Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
- Polynomial matrix inequality and semidefinite representation
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Real eigenvalues of nonsymmetric tensors
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
- Sums of squares, moment matrices and optimization over polynomials
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(12)- Algebraic degrees of generalized Nash equilibrium problems
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- An interior penalty method for a parabolic complementarity problem involving a fractional Black-Scholes operator
- The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
- Computing generalized Nash equilibria by polynomial programming
- A polynomial optimization framework for polynomial quasi-variational inequalities with moment-SOS relaxations
- A Lagrange multiplier approach using interval functions for generalized Nash equilibrium
- Convex generalized Nash equilibrium problems and polynomial optimization
- Risk-neutral PDE-constrained generalized Nash equilibrium problems
- Polynomial optimization relaxations for generalized semi-infinite programs
- Polynomial optimization over unions of sets
- A global approach for generalized semi-infinite programs with polyhedral parameter sets
This page was built for publication: Rational Generalized Nash Equilibrium Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116245)
