Twelve monotonicity conditions arising from algorithms for equilibrium problems
From MaRDI portal
Recommendations
Cites work
- A bundle method for solving equilibrium problems
- A convergent inexact solution method for equilibrium problems
- A descent method with inexact linear search for nonsmooth equilibrium problems
- A new solution method for equilibrium problems
- A note on D-gap functions for equilibrium problems
- An algorithm based on the generalized D-gap function for equilibrium problems
- An analytic center cutting plane algorithm for finding equilibrium points
- Application of the proximal point method to nonmonotone equilibrium problems
- Combined relaxation method for mixed equilibrium problems
- Combined relaxation method for monotone equilibrium problems
- Convergence and error bound of a D-gap function based Newton-type algorithm for equilibrium problems
- D-gap Functions for a Class of Equilibrium Problems in Banach Spaces
- Descent and penalization techniques for equilibrium problems with nonlinear constraints
- Descent methods for equilibrium problems in a Banach space
- Descent methods for monotone equilibrium problems in Banach spaces
- Dual extragradient algorithms extended to equilibrium problems
- Equilibrium programming using proximal-like algorithms
- Existence and solution methods for equilibria
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Extragradient algorithms extended to equilibrium problems¶
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Gap functions and penalization for solving equilibrium problems with nonlinear constraints
- Gap functions for equilibrium problems
- scientific article; zbMATH DE number 1090040 (Why is no real title available?)
- Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
- Iterative Algorithms for Equilibrium Problems
- Iterative methods for solving monotone equilibrium problems via dual gap functions
- Note on noncooperative convex games
- On equivalent equilibrium problems
- On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems
- On the proximal point method for equilibrium problems in Hilbert spaces
- Outer approximation algorithms for pseudomonotone equilibrium problems
- Partial proximal point method for nonmonotone equilibrium problems
- Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
- Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces
- The interior proximal extragradient method for solving equilibrium problems
- Unconstrained optimization reformulations of equilibrium problems
Cited in
(9)- Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities
- On penalty method for equilibrium problems in lexicographic order
- Solving non-monotone equilibrium problems via a DIRECT-type approach
- An augmented Lagrangian method for quasi-equilibrium problems
- D-gap functions and descent techniques for solving equilibrium problems
- Optimization tools for solving equilibrium problems with nonsmooth data
- Merit functions: a bridge between optimization and equilibria
- Nonsmooth techniques for computing projected solutions of quasiequilibria via gap functions
- An extragradient algorithm for a lifted reformulation of projected solutions for quasiequilibria
This page was built for publication: Twelve monotonicity conditions arising from algorithms for equilibrium problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943820)
