Interior proximal methods for equilibrium programming: part I
From MaRDI portal
Publication:2868931
DOI10.1080/02331934.2011.625028zbMath1278.90313OpenAlexW4242889676MaRDI QIDQ2868931
Publication date: 19 December 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.625028
Convex programming (90C25) Noncooperative games (91A10) Nonlinear programming (90C30) (n)-person games, (n>2) (91A06)
Related Items (2)
Interior proximal extragradient method for equilibrium problems ⋮ Solving non-monotone equilibrium problems via a DIRECT-type approach
Cites Work
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- On certain conditions for the existence of solutions of equilibrium problems
- Proximal minimization algorithm with \(D\)-functions
- Nash equilibria, variational inequalities, and dynamical systems
- Pseudomonotone operators and the Bregman proximal point algorithm
- A new solution method for equilibrium problems
- On the proximal point method for equilibrium problems in Hilbert spaces
- 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
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
- Interior Proximal Methods for equilibrium programming: part II
- Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets
This page was built for publication: Interior proximal methods for equilibrium programming: part I
