Interior proximal methods for equilibrium programming: part I
From MaRDI portal
Recommendations
- Interior Proximal Methods for equilibrium programming: part II
- The interior proximal extragradient method for solving equilibrium problems
- Interior proximal extragradient method for equilibrium problems
- An interior proximal cutting hyperplane method for equilibrium problems
- The interior linearization method for equilibrium programming problems
- Equilibrium programming: Proximal methods
- Interior point methods for equilibrium problems
- scientific article; zbMATH DE number 1086726
- Interior-point algorithms, penalty methods and equilibrium problems
- Equilibrium programming using proximal-like algorithms
Cites work
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A new solution method for equilibrium problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence analysis of an extended auxiliary problem principle with various stopping criteria
- FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
- 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
- Nash equilibria, variational inequalities, and dynamical systems
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Note on the paper: Interior proximal method for variational inequalities on non-polyhedral sets
- On certain conditions for the existence of solutions of equilibrium problems
- On the proximal point method for equilibrium problems in Hilbert spaces
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- Proximal minimization algorithm with \(D\)-functions
- Pseudomonotone operators and the Bregman proximal point algorithm
Cited in
(7)- Interior proximal extragradient method for equilibrium problems
- A minimization algorithm for equilibrium problems with polyhedral constraints
- Interior Proximal Methods for equilibrium programming: part II
- The interior proximal extragradient method for solving equilibrium problems
- Solving non-monotone equilibrium problems via a DIRECT-type approach
- Methods for solving equilibrium programming problems
- An interior proximal cutting hyperplane method for equilibrium problems
This page was built for publication: Interior proximal methods for equilibrium programming: part I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868931)
