scholarly journals A Hybrid Subgradient Algorithm for Finding a Common Solution of an Equilibrium Problem and a Family of Strict Pseudocontraction Mappings

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Ekkarath Thailert ◽  
Rabian Wangkeeree ◽  
Chanoksuda Khantree

We propose a new strongly convergent algorithm for finding a common point in the solution set of a class of pseudomonotone equilibrium problems and the set of common fixed points of a family of strict pseudocontraction mappings in a real Hilbert space. The strong convergence theorem of proposed algorithms is investigated without the Lipschitz condition for the bifunctions. Our results complement many known recent results in the literature.

Filomat ◽  
2020 ◽  
Vol 34 (5) ◽  
pp. 1721-1729
Author(s):  
Seyed Aleomraninejad ◽  
Kanokwan Sitthithakerngkiet ◽  
Poom Kumam

In this paper anew algorithm considered on a real Hilbert space for finding acommonpoint in the solution set of a class of pseudomonotone equilibrium problem and the set of fixed points of nonexpansive mappings. We produce this algorithm by mappings Tk that are approximations of non-expansive mapping T. The strong convergence theorem of the proposed algorithms is investigated. Our results generalize some recent results in the literature.


2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
D. R. Sahu ◽  
Shin Min Kang ◽  
Vidya Sagar

We introduce an explicit iterative scheme for computing a common fixed point of a sequence of nearly nonexpansive mappings defined on a closed convex subset of a real Hilbert space which is also a solution of a variational inequality problem. We prove a strong convergence theorem for a sequence generated by the considered iterative scheme under suitable conditions. Our strong convergence theorem extends and improves several corresponding results in the context of nearly nonexpansive mappings.


2012 ◽  
Vol 2012 ◽  
pp. 1-21 ◽  
Author(s):  
Rabian Wangkeeree ◽  
Pakkapon Preechasilp

We introduce the new iterative methods for finding a common solution set of monotone, Lipschitz-type continuous equilibrium problems and the set of fixed point of nonexpansive mappings which is a unique solution of some variational inequality. We prove the strong convergence theorems of such iterative scheme in a real Hilbert space. The main result extends various results existing in the current literature.


2022 ◽  
Vol 12 (1) ◽  
pp. 63
Author(s):  
Do Sang Kim ◽  
Nguyen Ngoc Hai ◽  
Bui Van Dinh

<p style='text-indent:20px;'>In this paper, we introduce three new iterative methods for finding a common point of the set of fixed points of a symmetric generalized hybrid mapping and the set of solutions of an equilibrium problem in a real Hilbert space. Each method can be considered as an combination of Ishikawa's process with the proximal point algorithm, the extragradient algorithm with or without linesearch. Under certain conditions on parameters, the iteration sequences generated by the proposed methods are proved to be weakly convergent to a solution of the problem. These results extend the previous results given in the literature. A numerical example is also provided to illustrate the proposed algorithms.</p>


Axioms ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 137
Author(s):  
Wiyada Kumam ◽  
Kanikar Muangchoo

A plethora of applications in non-linear analysis, including minimax problems, mathematical programming, the fixed-point problems, saddle-point problems, penalization and complementary problems, may be framed as a problem of equilibrium. Most of the methods used to solve equilibrium problems involve iterative methods, which is why the aim of this article is to establish a new iterative method by incorporating an inertial term with a subgradient extragradient method to solve the problem of equilibrium, which includes a bifunction that is strongly pseudomonotone and meets the Lipschitz-type condition in a real Hilbert space. Under certain mild conditions, a strong convergence theorem is proved, and a required sequence is generated without the information of the Lipschitz-type cost bifunction constants. Thus, the method operates with the help of a slow-converging step size sequence. In numerical analysis, we consider various equilibrium test problems to validate our proposed results.


Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 480
Author(s):  
Manatchanok Khonchaliew ◽  
Ali Farajzadeh ◽  
Narin Petrot

This paper presents two shrinking extragradient algorithms that can both find the solution sets of equilibrium problems for pseudomonotone bifunctions and find the sets of fixed points of quasi-nonexpansive mappings in a real Hilbert space. Under some constraint qualifications of the scalar sequences, these two new algorithms show strong convergence. Some numerical experiments are presented to demonstrate the new algorithms. Finally, the two introduced algorithms are compared with a standard, well-known algorithm.


Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1502
Author(s):  
Sun Young Cho

In a real Hilbert space, we investigate the Tseng’s extragradient algorithms with hybrid adaptive step-sizes for treating a Lipschitzian pseudomonotone variational inequality problem and a strict pseudocontraction fixed-point problem, which are symmetry. By imposing some appropriate weak assumptions on parameters, we obtain a norm solution of the problems, which solves a certain hierarchical variational inequality.


2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
F. O. Isiogugu ◽  
P. Pillay ◽  
P. U. Nwokoro

We establish the existence of a strong convergent selection of a modified Mann-Reich-Sabach iteration scheme for approximating the common elements of the set of fixed points F(T) of a multivalued (or single-valued) k-strictly pseudocontractive-type mapping T and the set of solutions EP(F) of an equilibrium problem for a bifunction F in a real Hilbert space H. This work is a continuation of the study on the computability and applicability of algorithms for approximating the solutions of equilibrium problems for bifunctions involving the construction of a sequence {Kn}n=1∞ of closed convex subsets of H from an arbitrary x0∈H and a sequence {xn}n=1∞ of the metric projections of x0 into Kn. The obtained result is a partial resolution of the controversy over the computability of such algorithms in the contemporary literature.


2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Huan-chun Wu ◽  
Cao-zong Cheng

We introduce a new iterative method for finding a common element of the set of solutions of an equilibrium problem and the set of all common fixed points of a nonexpansive semigroup and prove the strong convergence theorem in Hilbert spaces. Our result extends the recent result of Zegeye and Shahzad (2013). In the last part of the paper, by the way, we point out that there is a slight flaw in the proof of the main result in Shehu's paper (2012) and perfect the proof.


Sign in / Sign up

Export Citation Format

Share Document