A new parallel splitting augmented Lagrangian-based method for a Stackelberg game
DOI10.1186/s13660-016-1047-7zbMath1406.91076OpenAlexW2330523681WikidataQ59467864 ScholiaQ59467864MaRDI QIDQ267702
Publication date: 11 April 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1047-7
Hierarchical games (including Stackelberg games) (91A65) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Traffic problems in operations research (90B20) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Unnamed Item
- A new parallel splitting descent method for structured variational inequalities
- An improved two-step method for solving generalized Nash equilibrium problems
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities
- Generalized Nash equilibrium problems and Newton methods
- New parallel descent-like method for solving a class of variational inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- Projected dynamical systems and variational inequalities with applications
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Multiplier and gradient methods
- Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
This page was built for publication: A new parallel splitting augmented Lagrangian-based method for a Stackelberg game