The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
From MaRDI portal
Publication:2028496
Abstract: This paper concerns the generalized Nash equilibrium problem of polynomials (GNEPP). We apply the Gauss-Seidel method and Lasserre type Moment-SOS relaxations to solve GNEPPs. The convergence of the Gauss-Seidel method is known for some special GNEPPs, such as generalized potential games (GPGs). We give a sufficient condition for GPGs and propose a numerical certificate, based on Putinar's Positivstellensatz. Numerical examples for both convex and nonconvex GNEPPs are given for demonstrating the efficiency of the proposed method.
Recommendations
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Convex generalized Nash equilibrium problems and polynomial optimization
- Methods for solving generalized Nash equilibrium
- Computing generalized Nash equilibria by polynomial programming
- Relaxation methods for generalized Nash equilibrium problems with inexact line search
Cites work
- A game-theoretic formulation of joint implementation of environmental projects
- A generalized Nash equilibrium model of market coupling in the European power system
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
- A semidefinite approach for truncated \(K\)-moment problems
- A Social Equilibrium Existence Theorem*
- Algorithms for generalized potential games with mixed-integer variables
- An equilibrium model for urban transit assignment based on game theory
- 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
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- Computing generalized Nash equilibria by polynomial programming
- Decomposition algorithms for generalized potential games
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Equilibrium points in n -person games
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Existence of an Equilibrium for a Competitive Economy
- Generalized Nash equilibria for SaaS/PaaS clouds
- Generalized Nash equilibrium problems
- Generalized Nash equilibrium problems and Newton methods
- Generalized Nash games and quasi-variational inequalities
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- scientific article; zbMATH DE number 3827624 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 1243371 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Linear optimization with cones of moments and nonnegative polynomials
- Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
- Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints
- Non-cooperative games
- On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
- On generalized Nash games and variational inequalities
- On the Existence of General Equilibrium for a Competitive Market
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- Optimality conditions and finite convergence of Lasserre's hierarchy
- 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
- Partial penalization for the solution of generalized Nash equilibrium problems
- Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
- Potential games
- Pseudocontinuous functions and existence of Nash equilibria
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Relaxation methods for generalized Nash equilibrium problems with inexact line search
- Restricted generalized Nash equilibria and controlled penalty algorithm
- Set-valued analysis
- Shadow Prices for Measures of Effectiveness, I: Linear Model
- Shadow Prices for Measures of Effectiveness, II: General Model
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- The truncated moment problem via homogenization and flat extensions
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Variational Analysis
Cited in
(8)- Computing generalized Nash equilibria by polynomial programming
- Convex generalized Nash equilibrium problems and polynomial optimization
- LATIN 2004: Theoretical Informatics
- Rational Generalized Nash Equilibrium Problems
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- The majorization minimization algorithm for solving nonconvex generalized Nash equilibrium problems
- Algebraic degrees of generalized Nash equilibrium problems
- Generalized Nash equilibrium problems with quasi-linear constraints
This page was built for publication: The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028496)
