Convex generalized Nash equilibrium problems and polynomial optimization
From MaRDI portal
Recommendations
- Rational Generalized Nash Equilibrium Problems
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Computing generalized Nash equilibria by polynomial programming
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- Generalized Nash equilibrium problems
Cites work
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- A Frank--Wolfe type theorem for convex polynomial programs
- A Lagrange multiplier expression method for bilevel polynomial optimization
- A Social Equilibrium Existence Theorem*
- A game-theoretic formulation of joint implementation of environmental projects
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
- 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
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- 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
- 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
- Generating polynomials and symmetric tensor decompositions
- 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
- Low rank symmetric tensor approximations
- Matrix Cubes Parameterized by Eigenvalues
- Nash equilibria: the variational approach
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- On generalized Nash games and variational inequalities
- On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
- 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
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization of Polynomials on Compact Semialgebraic Sets
- Optimization over polynomials: selected topics
- 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
- Polynomial optimization with real varieties
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Relaxation methods for generalized Nash equilibrium problems with inexact line search
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Semidefinite representation of convex sets
- Sums of squares, moment matrices and optimization over polynomials
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- The \(\mathcal A\)-truncated \(K\)-moment problem
- The hierarchy of local minimums in polynomial optimization
- The saddle point problem of polynomials
- 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
Cited in
(12)- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Nash equilibrium problems of polynomials
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- Rational Generalized Nash Equilibrium Problems
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- Computing generalized Nash equilibria by polynomial programming
- The moment-SOS hierarchy: applications and related topics
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- LATIN 2004: Theoretical Informatics
- Convex Generalized Nash Equilibrium Problems and Polynomial Optimization
- Semidefinite games
This page was built for publication: Convex generalized Nash equilibrium problems and polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693649)
