Decomposable penalty method for generalized game problems with joint constraints
From MaRDI portal
Publication:5016002
DOI10.1080/02331934.2020.1793153zbMath1479.91013arXiv2003.09707OpenAlexW3042036900MaRDI QIDQ5016002
No author found.
Publication date: 10 December 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.09707
variational inequalitynoncooperative gamesgeneralized equilibrium pointsjoint constraintsdecomposable penalty method
Noncooperative games (91A10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shares allocation methods for generalized game problems with joint constraints
- Nonmonotone equilibrium problems: Coercivity conditions and weak regularization
- Restricted generalized Nash equilibria and controlled penalty algorithm
- Generalized Nash games and quasi-variational inequalities
- Decomposition method for oligopolistic competitive models with common environmental regulation
- Right-hand side decomposition for variational inequalities
- Regularized penalty method for general equilibrium problems in Banach spaces
- An approximate penalty method with descent for convex optimization problems
- Note on noncooperative convex games
- Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels
- The method of penalty functions in problems of high dimensionality
- On generalized Nash equilibrium in infinite dimension: the Lagrange multipliers approach
- Two-Level Planning
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- A Social Equilibrium Existence Theorem*
- Generalized Nash equilibrium problems
This page was built for publication: Decomposable penalty method for generalized game problems with joint constraints
