Combined relaxation method for monotone equilibrium problems

DOI10.1023/A:1011930301552zbMath1022.49005OpenAlexW21975091MaRDI QIDQ5956433

Igor V. Konnov

Publication date: 18 March 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011930301552

zbMATH Keywords

combined relaxation methodcost bifunctioninverse equilibrium problemmonotone equilibrium problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods of relaxation type (49M20)

Related Items

Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces ⋮ Iterative algorithms for multi-valued inclusions with \(Z\) mappings ⋮ The interior proximal extragradient method for solving equilibrium problems ⋮ Numerical solution procedures for the morning commute problem ⋮ Twelve monotonicity conditions arising from algorithms for equilibrium problems ⋮ An interior approximal method for solving pseudomonotone equilibrium problems ⋮ Set-valued equilibrium problems with applications to Browder variational inclusions and to fixed point theory ⋮ Error bounds of regularized gap functions for nonmonotone Ky Fan inequalities ⋮ A von Neumann alternating method for finding common solutions to variational inequalities ⋮ The Tikhonov regularization extended to equilibrium problems involving pseudomonotone bifunctions ⋮ A Douglas-Rachford splitting method for solving equilibrium problems ⋮ Nonlinear extended variational inequalities without differentiability: Applications and solution methods ⋮ A double projection algorithm for multi-valued variational inequalities and a unified framework of the method ⋮ Descent methods for monotone equilibrium problems in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for bound constrained quadratic programming problems
• On some generalized quasi-equilibrium problems
• Bound constrained quadratic programming via piecewise quadratic functions
• Combined subgradient methods for finding saddle points
• Combined relaxation methods for finding equilibrium points and solving related problems
• Note on noncooperative convex games
• Numerical methods for finding saddle points

This page was built for publication: Combined relaxation method for monotone equilibrium problems