33 research outputs found
A new inertial condition on the subgradient extragradient method for solving pseudomonotone equilibrium problem
In this paper we study the pseudomonotone equilibrium problem. We consider a
new inertial condition for the subgradient extragradient method with
self-adaptive step size for approximating a solution of the equilibrium problem
in a real Hilbert space. Our proposed method contains inertial factor with new
conditions that only depend on the iteration coefficient. We obtain a weak
convergence result of the proposed method under weaker conditions on the
inertial factor than many existing conditions in the literature. Finally, we
present some numerical experiments for our proposed method in comparison with
existing methods in the literature. Our result improves, extends and
generalizes several existing results in the literature
Some recent advances in projection-type methods for variational inequalities
AbstractProjection-type methods are a class of simple methods for solving variational inequalities, especially for complementarity problems. In this paper we review and summarize recent developments in this class of methods, and focus mainly on some new trends in projection-type methods
Projection-proximal methods for general variational inequalities
AbstractIn this paper, we consider and analyze some new projection-proximal methods for solving general variational inequalities. The modified methods converge for pseudomonotone operators which is a weaker condition than monotonicity. The proposed methods include several new and known methods as special cases. Our results can be considered as a novel and important extension of the previously known results. Since the general variational inequalities include the quasi-variational inequalities and implicit complementarity problems as special cases, results proved in this paper continue to hold for these problems
The Forward-Backward-Forward Method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces
Tseng's forward-backward-forward algorithm is a valuable alternative for
Korpelevich's extragradient method when solving variational inequalities over a
convex and closed set governed by monotone and Lipschitz continuous operators,
as it requires in every step only one projection operation. However, it is
well-known that Korpelevich's method converges and can therefore be used also
for solving variational inequalities governed by pseudo-monotone and Lipschitz
continuous operators. In this paper, we first associate to a pseudo-monotone
variational inequality a forward-backward-forward dynamical system and carry
out an asymptotic analysis for the generated trajectories. The explicit time
discretization of this system results into Tseng's forward-backward-forward
algorithm with relaxation parameters, which we prove to converge also when it
is applied to pseudo-monotone variational inequalities. In addition, we show
that linear convergence is guaranteed under strong pseudo-monotonicity.
Numerical experiments are carried out for pseudo-monotone variational
inequalities over polyhedral sets and fractional programming problems