Results 11 to 20 of about 290 (158)
In real Hilbert spaces, let the CFPP indicate a common fixed-point problem of asymptotically nonexpansive operator and countably many nonexpansive operators, and suppose that the HVI and VIP represent a hierarchical variational inequality and a ...
Yun-Ling Cui +6 more
doaj +2 more sources
Parallel Extragradient-Proximal Methods for Split Equilibrium Problems
In this paper, we introduce two parallel extragradient-proximal methods for solving split equilibrium problems. The algorithms combine the extragradient method, the proximal method and the shrinking projection method.
Dang Van Hieu
doaj +4 more sources
An Implicit Extragradient Method for Hierarchical Variational Inequalities [PDF]
As a well-known numerical method, the extragradient method solves numerically the variational inequality of finding such that , for all . In this paper, we devote to solve the following hierarchical variational inequality Find such that , for
Liou YeongCheng, Yao Yonghong
doaj +4 more sources
Extended Extragradient Methods for Generalized Variational Inequalities [PDF]
We suggest a modified extragradient method for solving the generalized variational inequalities in a Banach space. We prove some strong convergence results under some mild conditions on parameters. Some special cases are also discussed.
Yonghong Yao +3 more
doaj +4 more sources
Extragradient Method for Fixed Points in CAT(0) Spaces [PDF]
This paper is dedicated to construct a viscosity extragradient algorithm for finding fixed points in a CAT(0) space. The mappings we consider are nonexpansive. Strong convergence of the algorithm is obtained.
Yu-Pei Lv +4 more
doaj +3 more sources
A Mean Extragradient Method for Solving Variational Inequalities [PDF]
We propose a modified extragradient method for solving the variational inequality problem in a Hilbert space. The method is a combination of the well-known subgradient extragradient with the Mann’s mean value method in which the updated iterate is picked in the convex hull of all previous iterates.
Apichit Buakird +2 more
openaire +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 +5 more sources
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
This paper considers an alternated inertial‐type extrapolation algorithm for solving bilevel pseudomonotone variational inequality problem in the framework of real Hilbert spaces with split variational inequality and fixed‐point constraints of demimetric mapping.
Jacob Ashiwere Abuchu +5 more
wiley +1 more source
In this paper, we present improved iterative methods for evaluating the numerical solution of an equilibrium problem in a Hilbert space with a pseudomonotone and a Lipschitz‐type bifunction. The method is built around two computing phases of a proximal‐like mapping with inertial terms.
Chainarong Khunpanuk +3 more
wiley +1 more source

