Results 1 to 10 of about 2,116 (158)

Parallel Extragradient-Proximal Methods for Split Equilibrium Problems [PDF]

open access: yesMathematical Modelling and Analysis, 2016
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   +7 more sources

Bounded perturbation resilience of extragradient-type methods and their applications [PDF]

open access: yesJournal of Inequalities and Applications, 2017
In this paper we study the bounded perturbation resilience of the extragradient and the subgradient extragradient methods for solving a variational inequality (VI) problem in real Hilbert spaces.
Q-L Dong, A Gibali, D Jiang, Y Tang
doaj   +7 more sources

An alternative extragradient projection method for quasi-equilibrium problems [PDF]

open access: yesJournal of Inequalities and Applications, 2018
For the quasi-equilibrium problem where the players’ costs and their strategies both depend on the rival’s decisions, an alternative extragradient projection method for solving it is designed.
Haibin Chen, Yiju Wang, Yi Xu
doaj   +5 more sources

Extragradient Method for Fixed Points in CAT(0) Spaces [PDF]

open access: yesJournal of Function Spaces, 2021
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   +4 more sources

Extragradient subgradient methods for solving bilevel equilibrium problems. [PDF]

open access: yesJ Inequal Appl, 2018
In this paper, we propose two algorithms for finding the solution of a bilevel equilibrium problem in a real Hilbert space. Under some sufficient assumptions on the bifunctions involving pseudomonotone and Lipschitz-type conditions, we obtain the strong convergence of the iterative sequence generated by the first algorithm.
Yuying T, Dinh BV, Kim DS, Plubtieng S.
europepmc   +6 more sources

An Implicit Extragradient Method for Hierarchical Variational Inequalities [PDF]

open access: yesFixed Point Theory and Applications, 2011
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]

open access: yesJournal of Applied Mathematics, 2012
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   +3 more sources

Weak convergence theorem for a class of split variational inequality problems and applications in a Hilbert space [PDF]

open access: yesJournal of Inequalities and Applications, 2017
In this paper, we consider the algorithm proposed in recent years by Censor, Gibali and Reich, which solves split variational inequality problem, and Korpelevich’s extragradient method, which solves variational inequality problems. As our main result, we
Ming Tian, Bing-Nan Jiang
doaj   +2 more sources

Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem [PDF]

open access: yesJournal of Inequalities and Applications, 2017
This paper introduces a new extragradient-type method to solve the multiple-sets split equality problem (MSSEP). Under some suitable conditions, the strong convergence of an algorithm can be verified in the infinite-dimensional Hilbert spaces.
Ying Zhao, Luoyi Shi
doaj   +2 more sources

An Extragradient-Based Alternating Direction Method for Convex Minimization [PDF]

open access: yesFoundations of Computational Mathematics, 2015
In this paper, we consider the problem of minimizing the sum of two convex functions subject to linear linking constraints. The classical alternating direction type methods usually assume that the two convex functions have relatively easy proximal ...
Lin, Tianyi   +2 more
core   +5 more sources

Home - About - Disclaimer - Privacy