Modified basic projection methods for a class of equilibrium problems
From MaRDI portal
The equilibrium problem considered in the paper is formulated as follows: \[ \text{ Find }x^* \in C \subset \mathbb R^s\text{ such that }f(x^*,y) \geq 0\quad \forall y \in C, \] where \(C\) is a closed convex set, \(f: \mathbb R^s \times \mathbb R^s ~\longrightarrow~ \mathbb R \cup \{ +\infty \},~ f(x,x) = 0 ~\forall x \in\mathbb R^s\). The purpose of the paper is to extend the projection and subgradient methods published in the literature. The extension consists in ``computing an approximate subgradient of a subdifferentiable convex function and an orthogonal projection onto separating hyperplanes. Convergence of the iteration sequence obtained by combining projection and subgradient methods to the solution of the equilibrium problem is established. Some illustrating numerical examples are presented in the last section of the paper.
Recommendations
- A relaxed projection method for finite-dimensional equilibrium problems
- An inexact subgradient algorithm for equilibrium problems
- scientific article; zbMATH DE number 6285809
- Inertial subgradient projection algorithms extended to equilibrium problems
- A projection method for pseudomonotone equilibrium problems
Cites work
- A class of combined iterative methods for solving variational inequalities
- A combined relaxation method for variational inequalities with nonlinear constraints
- A hybrid iterative scheme for a maximal monotone operator and two countable families of relatively quasi-nonexpansive mappings for generalized mixed equilibrium and variational inequality problems
- A new class of hybrid extragradient algorithms for solving quasi-equilibrium problems
- A relaxed projection method for variational inequalities
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
- An Armijo-type method for pseudomonotone equilibrium problems and its applications
- An inexact subgradient algorithm for equilibrium problems
- Auxiliary principle technique for equilibrium problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Dual extragradient algorithms extended to equilibrium problems
- Entropy-Like Proximal Methods in Convex Programming
- Extragradient algorithms extended to equilibrium problems¶
- Gap functions for equilibrium problems
- Gap functions for quasi-equilibria
- scientific article; zbMATH DE number 4147426 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1290200 (Why is no real title available?)
- Hybrid proximal-point methods for zeros of maximal monotone operators, variational inequalities and mixed equilibrium problems
- On ergodic algorithms for equilibrium problems
- On the convergence properties of the projected gradient method for convex optimization
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Projected reflected gradient methods for monotone variational inequalities
- Set-valued mappings and enlargement of monotone operators.
- The subgradient extragradient method extended to equilibrium problems
Cited in
(23)- Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems
- Two strongly convergent self-adaptive iterative schemes for solving pseudo-monotone equilibrium problems with applications
- Extragradient subgradient methods for solving bilevel equilibrium problems
- Weak convergence of explicit extragradient algorithms for solving equilibrium problems
- Iterative algorithms of common solutions for a hierarchical fixed point problem, a system of variational inequalities, and a split equilibrium problem in Hilbert spaces
- Modifying the shooting model for solving equilibrium problems
- Subgradient projection methods extended to monotone bilevel equilibrium problems in Hilbert spaces
- Projection methods for solving split equilibrium problems
- A subgradient method for equilibrium problems involving quasiconvex bifunctions
- A relaxed projection method for finite-dimensional equilibrium problems
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications
- TAYLOR PROJECTION: A NEW SOLUTION METHOD FOR DYNAMIC GENERAL EQUILIBRIUM MODELS
- A modified projection algorithm for constrained equilibrium problems
- Low-cost modification of Korpelevich's methods for monotone equilibrium problems
- A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
- Conjugate duality for concave maximization problems and applications
- scientific article; zbMATH DE number 6285809 (Why is no real title available?)
- An inexact subgradient algorithm for equilibrium problems
- Strong quasi-nonexpansiveness of solution mappings of equilibrium problems
- Inertial subgradient projection techniques for solving a class of bilevel equilibrium problems
- A proximal-type algorithm with Bregman distance for solving equilibrium problems
- A C-FISTA-type proximal point algorithm for strongly quasiconvex pseudomonotone equilibrium problems
- New projection methods for equilibrium problems over fixed point sets
This page was built for publication: Modified basic projection methods for a class of equilibrium problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413497)
