A two-phase algorithm for a variational inequality formulation of equilibrium problems
From MaRDI portal
Publication:2442699
DOI10.1007/s10957-012-0181-8zbMath1302.90221OpenAlexW2064875295MaRDI QIDQ2442699
Paulo Sérgio M. Santos, Susana Scheimberg, José Yunier Bello Cruz
Publication date: 1 April 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0181-8
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A new iterative algorithm for pseudomonotone equilibrium problem and a finite family of demicontractive mappings ⋮ Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces ⋮ A proximal Newton-type method for equilibrium problems ⋮ A family of extragradient methods for solving equilibrium problems ⋮ Gradient projection-type algorithms for solving equilibrium problems and its applications ⋮ On existence and solution methods for strongly pseudomonotone equilibrium problems ⋮ A quasi-Newton type method for equilibrium problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Low-cost modification of Korpelevich's methods for monotone equilibrium problems
- An inexact subgradient algorithm for equilibrium problems
- Application of the proximal point method to nonmonotone equilibrium problems
- The interior proximal extragradient method for solving equilibrium problems
- A bundle-filter method for nonsmooth convex constrained optimization
- Convergence of direct methods for paramonotone variational inequalities
- An inexact bundle variant suited to column generation
- Subgradient methods for saddle-point problems
- Relaxation methods for generalized Nash equilibrium problems with inexact line search
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- Generalized Mann iterates for constructing fixed points in Hilbert spaces
- On the proximal point method for equilibrium problems in Hilbert spaces
- A relaxed projection method for finite-dimensional equilibrium problems
- An explicit algorithm for monotone variational inequalities
- A relaxed projection method for variational inequalities
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- Iterative Algorithms for Equilibrium Problems
- Extragradient algorithms extended to equilibrium problems¶
