Interior point methods for equilibrium problems
From MaRDI portal
Recommendations
- Interior-point algorithms, penalty methods and equilibrium problems
- The interior linearization method for equilibrium programming problems
- Interior-point methods
- Publication:4355913
- Publication:4358711
- Interior-point methods for optimization
- Interior point methods of mathematical programming
- The interior proximal extragradient method for solving equilibrium problems
- Interior Proximal Methods for equilibrium programming: part II
Cites work
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2202892 (Why is no real title available?)
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A bundle method for solving equilibrium problems
- A logarithmic-quadratic proximal method for variational inequalities
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Application of the proximal point method to nonmonotone equilibrium problems
- Auxiliary principle technique for equilibrium problems
- Auxiliary problem principle extended to variational inequalities
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Equilibrium programming using proximal-like algorithms
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Gap function approach to the generalized Nash equilibrium problem
- Generalized Nash equilibrium problems
- Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
- Learning equilibrium play: A myopic approach
- 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
- Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems
- On certain conditions for the existence of solutions of equilibrium problems
- On inexact generalized proximal methods with a weakened error tolerance criterion
- On the maximal monotonicity of diagonal subdifferential operators
- On the proximal point method for equilibrium problems in Hilbert spaces
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- Paths to constrained Nash equilibria
- Proximal minimization algorithm with \(D\)-functions
- Pseudomonotone operators and the Bregman proximal point algorithm
- The interior proximal extragradient method for solving equilibrium problems
Cited in
(12)- An interior approximal method for solving pseudomonotone equilibrium problems
- Interior proximal extragradient method for equilibrium problems
- A projection iterative algorithm for strong vector equilibrium problem
- The auxiliary problem principle with self-adaptive penalty parameter for multi-area economic dispatch problem
- Abstract regularized equilibria: application to Becker's household behavior theory
- Interior Proximal Methods for equilibrium programming: part II
- Interior point methods for solving Pareto eigenvalue complementarity problems
- Interior-point algorithms, penalty methods and equilibrium problems
- A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
- Interior proximal methods for equilibrium programming: part I
- On the interior point method for solving thermodynamic equilibrium problems
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems
This page was built for publication: Interior point methods for equilibrium problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928742)
