Combined relaxation method for monotone equilibrium problems

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

Igor V. Konnov

Publication date: 18 March 2003

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

zbMATH Keywords

combined relaxation method; cost bifunction; inverse equilibrium problem; monotone equilibrium problem

Mathematics Subject Classification ID

90C47: Minimax problems in mathematical programming

49J40: Variational inequalities

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

49M20: Numerical methods of relaxation type

Related Items

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

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