Twelve monotonicity conditions arising from algorithms for equilibrium problems
From MaRDI portal
Publication:2943820
DOI10.1080/10556788.2014.900552zbMath1327.90333WikidataQ58097194 ScholiaQ58097194MaRDI QIDQ2943820
Giancarlo Bigi, Mauro Passacantando
Publication date: 4 September 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://eprints.adm.unipi.it/2313/1/TR%2D13%2D17.pdf.gz
90C30: Nonlinear programming
47H05: Monotone operators and generalizations
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Merit functions: a bridge between optimization and equilibria, Optimization tools for solving equilibrium problems with nonsmooth data, Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities, On penalty method for equilibrium problems in lexicographic order, An augmented Lagrangian method for quasi-equilibrium problems, D-gap functions and descent techniques for solving equilibrium problems
Cites Work
- Unnamed Item
- Iterative methods for solving monotone equilibrium problems via dual gap functions
- Application of the proximal point method to nonmonotone equilibrium problems
- On equivalent equilibrium problems
- Outer approximation algorithms for pseudomonotone equilibrium problems
- Dual extragradient algorithms extended to equilibrium problems
- Descent methods for monotone equilibrium problems in Banach spaces
- The interior proximal extragradient method for solving equilibrium problems
- Combined relaxation method for mixed equilibrium problems
- A bundle method for solving equilibrium problems
- Convergence and error bound of a D-gap function based Newton-type algorithm for equilibrium problems
- Unconstrained optimization reformulations of equilibrium problems
- Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
- Equilibrium programming using proximal-like algorithms
- Gap functions for equilibrium problems
- Descent methods for equilibrium problems in a Banach space
- Gap functions and penalization for solving equilibrium problems with nonlinear constraints
- Existence and solution methods for equilibria
- Descent and penalization techniques for equilibrium problems with nonlinear constraints
- An algorithm based on the generalized D-gap function for equilibrium problems
- Note on noncooperative convex games
- A new solution method for equilibrium problems
- A convergent inexact solution method for equilibrium problems
- Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces
- On the proximal point method for equilibrium problems in Hilbert spaces
- An analytic center cutting plane algorithm for finding equilibrium points
- A descent method with inexact linear search for nonsmooth equilibrium problems
- D-gap Functions for a Class of Equilibrium Problems in Banach Spaces
- Iterative Algorithms for Equilibrium Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A note on D-gap functions for equilibrium problems
- Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces
- On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems
- Partial proximal point method for nonmonotone equilibrium problems
- Extragradient algorithms extended to equilibrium problems¶
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Combined relaxation method for monotone equilibrium problems
