Results 21 to 30 of about 115 (92)
On Strongly Generalized Preinvex Fuzzy Mappings
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 In this article, we introduce a new notion of generalized convex fuzzy mapping known as strongly generalized preinvex fuzzy mapping on the invex set. Firstly, we have investigated some properties of strongly generalized preinvex fuzzy mapping. In particular, we establish the equivalence among the strongly generalized preinvex fuzzy mapping, strongly ...
Peide Liu +4 more
wiley +1 more source
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 In this paper, we introduce a Halpern algorithm and a nonconvex combination algorithm to approximate a solution of the split common fixed problem of quasi‐ϕ‐nonexpansive mappings in Banach space. In our algorithms, the norm of linear bounded operator does not need to be known in advance.
Gaobo Li, Sun Young Cho
wiley +1 more source
Extragradient Method for Fixed Points in CAT(0) Spaces
Journal of Function Spaces, Volume 2021, Issue 1, 2021., 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. The results established in this work extend and improve some recent discovers in the literature.
Yu-Pei Lv +5 more
wiley +1 more source
Extragradient-like method for pseudomontone equilibrium problems on Hadamard manifolds
Journal of Inequalities and Applications, 2020 This paper presents an extragradient-like method for solving a pseudomonotone equilibrium problem with a Lipschitz-type condition on Hadamard manifolds. The algorithm only needs to know the existence of the Lipschitz-type constants of the bifunction, and
Junfeng Chen, Sanyang Liu
doaj +1 more source
A projected subgradient-proximal method for split equality equilibrium problems of pseudomonotone bifunctions in Banach spaces [PDF]
Journal of Nonlinear and Variational Analysis, 2019 Summary: In this paper, we propose a simultaneous projected subgradient-proximal type iterative algorithm to solve a split equality equilibrium problem with pseudomonotone bifunctions in 2-uniformly convex and uniformly smooth Banach spaces. We obtain convergence results under some mild conditions on the bifunctions.
Ogbuisi, Ferdinard U., Shehu, Yekini
openaire +1 more source
On Strengthened Extragradient Methods Non-Convex Combination with Adaptive Step Sizes Rule for Equilibrium Problems [PDF]
, 2022 Symmetries play a vital role in the study of physical phenomena in diverse areas such as dynamic systems, optimization, physics, scientific computing, engineering, mathematical biology, chemistry, and medicine, to mention a few.
Wiyada Kumam +3 more
core +1 more source
Advances in Difference Equations, 2021 This paper provides iterative construction of a common solution associated with the classes of equilibrium problems (EP) and split convex feasibility problems.
Yasir Arfat +4 more
doaj +1 more source
Abstract and Applied Analysis, Volume 2020, Issue 1, 2020., 2020 In this paper, we introduce a new iterative method in a real Hilbert space for approximating a point in the solution set of a pseudomonotone equilibrium problem which is a common fixed point of a finite family of demicontractive mappings. Our result does not require that we impose the condition that the sum of the control sequences used in the finite ...
F. U. Ogbuisi +2 more
wiley +1 more source
Inertial Extragradient Methods for Solving Split Equilibrium Problems
Mathematics, 2021 This paper presents two inertial extragradient algorithms for finding a solution of split pseudomonotone equilibrium problems in the setting of real Hilbert spaces. The weak and strong convergence theorems of the introduced algorithms are presented under
Suthep Suantai +2 more
doaj +1 more source
A splitting subgradient algorithm for solving equilibrium problems involving the sum of two bifunctions and application to cournot-nash model [PDF]
, 2021 In this paper we propose a splitting subgradient algorithm for solving equilibrium problems involving the sum of two bifunctions. At each iteration of the algorithm, two strongly convex subprograms are required to solve separately, one for each component
Phung Minh Duc, Xuan Thanh Le
core +1 more source