Results 21 to 30 of about 683 (180)
An extragradient-like approximation method for variational inequalities and fixed point problems [PDF]
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping in the intermediate sense and the set of solutions of a variational inequality problem ...
Wong Ngai-Ching +3 more
doaj +5 more sources
Extension of Extragradient Techniques for Variational Inequalities [PDF]
An extragradient type method for finding the common solutions of two variational inequalities has been proposed. The convergence result of the algorithm is given under mild conditions on the algorithm parameters.
Yonghong Yao +3 more
doaj +2 more sources
Strong Convergence of a Modified Extragradient Method to the Minimum-Norm Solution of Variational Inequalities [PDF]
We suggest and analyze a modified extragradient method for solving variational inequalities, which is convergent strongly to the minimum-norm solution of some variational inequality in an infinite-dimensional Hilbert space.
Yonghong Yao +2 more
doaj +2 more sources
A doublestep extragradient method for solving a resource management problem [PDF]
In the article is proposed a doublestep extragradient method for solving nonintrinsic problems of linear programming, variational inequalities and some related problems. The convergence of this method in general case is proved.
A. V. Zykina, N. V. Melenchuk
doaj +1 more source
A modified subgradient extragradient method for solving monotone variational inequalities. [PDF]
In the setting of Hilbert space, a modified subgradient extragradient method is proposed for solving Lipschitz-continuous and monotone variational inequalities defined on a level set of a convex function.
He S, Wu T.
europepmc +2 more sources
Extragradient Method in Optimization: Convergence and Complexity [PDF]
We consider the extragradient method to minimize the sum of two functions, the first one being smooth and the second being convex. Under the Kurdyka-Lojasiewicz assumption, we prove that the sequence produced by the extragradient method converges to a critical point of the problem and has finite length.
Trong Phong Nguyen +3 more
openaire +4 more sources
In this paper, we introduce two new subgradient extragradient algorithms to find the solution of a bilevel equilibrium problem in which the pseudomonotone and Lipschitz‐type continuous bifunctions are involved in a real Hilbert space. The first method needs the prior knowledge of the Lipschitz constants of the bifunctions while the second method uses a
Gaobo Li, Sun Young Cho
wiley +1 more source
Decentralized Stochastic Variance Reduced Extragradient Method
This paper studies decentralized convex-concave minimax optimization problems of the form $\min_x\max_y f(x,y) \triangleq\frac{1}{m}\sum_{i=1}^m f_i(x,y)$, where $m$ is the number of agents and each local function can be written as $f_i(x,y)=\frac{1}{n}\sum_{j=1}^n f_{i,j}(x,y)$.
Luo Luo, Haishan Ye
openaire +2 more sources
Many applications in applied sciences and engineering can be considered as the convex minimization problem with the sum of two functions. One of the most popular techniques to solve this problem is the forward‐backward algorithm. In this work, we aim to present a new version of splitting algorithms by adapting with Tseng’s extragradient method and ...
Kunrada Kankam +3 more
wiley +1 more source
In this paper, we introduce a new extragradient algorithm by using generalized metric projection. We prove a strong convergence theorem for finding a common element of the solution set of split feasibility problem and the set of fixed points of relatively nonexpansive mapping and a finite family of resolvent operator and the set of solutions of an ...
Mostafa Ghadampour, Giovanni Di Fratta
wiley +1 more source

