A modified subgradient extragradient method for solving the variational inequality problem
0
Citation
28
Reference
10
Related Paper
Abstract:
The subgradient extragradient method for solving the variational inequality (VI) problem, which is introduced by Censor et al. \cite{CGR}, replaces the second projection onto the feasible set of the VI, in the extragradient method, with a subgradient projection onto some constructible half-space. Since the method has been introduced, many authors proposed extensions and modifications with applications to various problems. In this paper, we introduce a modified subgradient extragradient method by improving the stepsize of its second step. Convergence of the proposed method is proved under standard and mild conditions and primary numerical experiments illustrate the performance and advantage of this new subgradient extragradient variant.Keywords:
Subgradient method
Projection method
The subgradient extragradient method for solving the variational inequality (VI) problem, which is introduced by Censor et al. \cite{CGR}, replaces the second projection onto the feasible set of the VI, in the extragradient method, with a subgradient projection onto some constructible half-space. Since the method has been introduced, many authors proposed extensions and modifications with applications to various problems. In this paper, we introduce a modified subgradient extragradient method by improving the stepsize of its second step. Convergence of the proposed method is proved under standard and mild conditions and primary numerical experiments illustrate the performance and advantage of this new subgradient extragradient variant.
Subgradient method
Projection method
Cite
Citations (0)
Subgradient method
Sequence (biology)
Projection method
Cite
Citations (25)
In this paper, we introduce a cyclic subgradient extragradient algorithm and its modified form for finding a solution of a system of equilibrium problems for a class of pseudomonotone and Lipschitz-type continuous bifunctions. The main idea of these algorithms originates from several previously known results for variational inequalities. The proposed algorithms are extensions of the subgradient extragradient method for variational inequalities to equilibrium problems and the hybrid (outer approximation) method. The paper can help in the design and analysis of practical algorithms and gives us a generalization of the most convex feasibility problems.
Subgradient method
Quasiconvex function
Cite
Citations (6)
In this paper, we investigate the monotone variational inequality in Hilbert spaces. Based on Censor’s subgradient extragradient method, we propose two modified subgradient extragradient algorithms with self-adaptive and inertial techniques for finding the solution of the monotone variational inequality in real Hilbert spaces. Strong convergence analysis of the proposed algorithms have been obtained under some mild conditions.
Subgradient method
Weak convergence
Cite
Citations (0)
Subgradient method
Complementarity (molecular biology)
Projection method
Cite
Citations (3)
The subgradient extragradient method can be considered as an improvement of the extragradient method for variational inequality problems for the class of monotone and Lipschitz continuous mappings. In this paper, we propose two new algorithms as combination between the subgradient extragradient method and Mann-like method for finding a common element of the solution set of a variational inequality and the fixed point set of a demicontractive mapping.
Subgradient method
Cite
Citations (66)
Subgradient method
Theory of computation
Projection method
Cite
Citations (63)
The goal of the note is to introduce a new modified subgradient extragradient algorithm for solving variational inequalities in Hilbert spaces. A result on the strong convergence of the algorithm is proved without the knowledge of Lipschitz constant of the operator. Several numerical experiments for the proposed algorithm are presented.
Subgradient method
Operator (biology)
Constant (computer programming)
Cite
Citations (15)
In this paper, we consider the modification of equilibrium problem (MEP) and new subgradient extragradient algorithm by using the concept of the set of solutions of the modified variational inequality problem introduced by [Kangtunyakarn A. A new iterative scheme for fixed-point problems of infinite family of κi pseudo contractive mappings, equilibrium problem, variational inequality problems. J Optim Theory Appl. 2013;56:1543–1562.]. Then, we establish and prove weak and strong convergence theorem of the new subgradient extragradient algorithm for finding a common element of the set of solutions of the MEP and two sets of the variational inequality problems under some suitable conditions on αn and βn with αn+βn≤ 1. Moreover, we apply our main theorem to prove weak and strong convergence theorems to solve the generalized equilibrium problem, the system of equilibrium problem, the variational inequality problem and the general system of variational inequality problems. Finally, we give two numerical examples to support our main result.
Subgradient method
Solution set
Cite
Citations (3)
Subgradient method
Theory of computation
Weak convergence
Cite
Citations (732)