Interior Proximal Methods for equilibrium programming: part II
From MaRDI portal
Publication:5746733
DOI10.1080/02331934.2011.627334zbMath1285.90034MaRDI QIDQ5746733
Publication date: 7 February 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.627334
90C25: Convex programming
91A10: Noncooperative games
90C30: Nonlinear programming
91A06: (n)-person games, (n>2)
Related Items
Solving non-monotone equilibrium problems via a DIRECT-type approach, On fixed point approach to equilibrium problem, Interior proximal methods for equilibrium programming: part I, Interior proximal extragradient method for equilibrium problems
Cites Work
- The interior proximal extragradient method for solving equilibrium problems
- On certain conditions for the existence of solutions of equilibrium problems
- A bundle method for solving equilibrium problems
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Approximate iterations in Bregman-function-based proximal algorithms
- A logarithmic-quadratic proximal method for variational inequalities
- Proximal minimization algorithm with \(D\)-functions
- Nash equilibria, variational inequalities, and dynamical systems
- Pseudomonotone operators and the Bregman proximal point algorithm
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A new solution method for equilibrium problems
- Convergence analysis of an extended auxiliary problem principle with various stopping criteria
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets