scholarly journals Shrinking Projection Methods for Accelerating Relaxed Inertial Tseng-Type Algorithm with Applications

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Hasanen A. Hammad ◽  
Habib ur Rehman ◽  
Manuel De la Sen

Our main goal in this manuscript is to accelerate the relaxed inertial Tseng-type (RITT) algorithm by adding a shrinking projection (SP) term to the algorithm. Hence, strong convergence results were obtained in a real Hilbert space (RHS). A novel structure was used to solve an inclusion and a minimization problem under proper hypotheses. Finally, numerical experiments to elucidate the applications, performance, quickness, and effectiveness of our procedure are discussed.

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.


Filomat ◽  
2020 ◽  
Vol 34 (8) ◽  
pp. 2495-2510
Author(s):  
Watcharaporn Chaolamjiak ◽  
Suhel Khan ◽  
Hasanen Hammad ◽  
Hemen Dutta

The paper aims to present an advanced algorithm by taking help of the Noor-iteration scheme along with the inertial technical term for three quasi-nonexpansive multivalued in Hilbert spaces. A weak convergence theorem under certain conditions has been given and added the CQ and shrinking projection methods to our algorithm to obtain certain strong convergence results. Furthermore, numerical experiments are provided by constructing an example and comparison results have also been incorporated.


Author(s):  
A. U. Bello ◽  
M. T. Omojola ◽  
J. Yahaya

AbstractLet H be a real Hilbert space. Let $F:H\rightarrow 2^{H}$ F : H → 2 H and $K:H\rightarrow 2^{H}$ K : H → 2 H be two maximal monotone and bounded operators. Suppose the Hammerstein inclusion $0\in u+KFu$ 0 ∈ u + K F u has a solution. We construct an inertial-type algorithm and show its strong convergence to a solution of the inclusion. As far as we know, this is the first inertial-type algorithm for Hammerstein inclusions in Hilbert spaces. We also give numerical examples to compare the new algorithm with some existing ones in the literature.


2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Bin-Chao Deng ◽  
Tong Chen

LetHbe a real Hilbert space. LetT1,T2:H→Hbek1-,k2-strictly pseudononspreading mappings; letαnandβnbe two real sequences in (0,1). For givenx0∈H, the sequencexnis generated iteratively byxn+1=βnxn+1-βnTw1αnγfxn+I-μαnBTw2xn,∀n∈N, whereTwi=1−wiI+wiTiwithi=1,2andB:H→His strongly monotone and Lipschitzian. Under some mild conditions on parametersαnandβn, we prove that the sequencexnconverges strongly to the setFixT1∩FixT2of fixed points of a pair of strictly pseudononspreading mappingsT1andT2.


2020 ◽  
Vol 16 (01) ◽  
pp. 89-103
Author(s):  
W. Cholamjiak ◽  
D. Yambangwai ◽  
H. Dutta ◽  
H. A. Hammad

In this paper, we introduce four new iterative schemes by modifying the CQ-method with Ishikawa and [Formula: see text]-iterations. The strong convergence theorems are given by the CQ-projection method with our modified iterations for obtaining a common fixed point of two [Formula: see text]-nonexpansive mappings in a Hilbert space with a directed graph. Finally, to compare the rate of convergence and support our main theorems, we give some numerical experiments.


Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 156 ◽  
Author(s):  
Chanjuan Pan ◽  
Yuanheng Wang

In this article, we study a modified viscosity splitting method combined with inertial extrapolation for accretive operators in Banach spaces and then establish a strong convergence theorem for such iterations under some suitable assumptions on the sequences of parameters. As an application, we extend our main results to solve the convex minimization problem. Moreover, the numerical experiments are presented to support the feasibility and efficiency of the proposed method.


2012 ◽  
Vol 2012 ◽  
pp. 1-27 ◽  
Author(s):  
Bin-Chao Deng ◽  
Tong Chen ◽  
Baogui Xin

Let{T}i=1NbeNquasi-nonexpansive mappings defined on a closed convex subsetCof a real Hilbert spaceH. Consider the problem of finding a common fixed point of these mappings and introduce the parallel and cyclic algorithms for solving this problem. We will prove the strong convergence of these algorithms.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Songnian He ◽  
Caiping Yang

Consider the variational inequalityVI(C,F)of finding a pointx*∈Csatisfying the property〈Fx*,x-x*〉≥0, for allx∈C, whereCis the intersection of finite level sets of convex functions defined on a real Hilbert spaceHandF:H→His anL-Lipschitzian andη-strongly monotone operator. Relaxed and self-adaptive iterative algorithms are devised for computing the unique solution ofVI(C,F). Since our algorithm avoids calculating the projectionPC(calculatingPCby computing several sequences of projections onto half-spaces containing the original domainC) directly and has no need to know any information of the constantsLandη, the implementation of our algorithm is very easy. To prove strong convergence of our algorithms, a new lemma is established, which can be used as a fundamental tool for solving some nonlinear problems.


Filomat ◽  
2019 ◽  
Vol 33 (6) ◽  
pp. 1677-1693 ◽  
Author(s):  
Shenghua Wang ◽  
Yifan Zhang ◽  
Ping Ping ◽  
Yeol Cho ◽  
Haichao Guo

In the literature, the most authors modify the viscosity methods or hybrid projection methods to construct the strong convergence algorithms for solving the pseudomonotone equilibrium problems. In this paper, we introduce some new extragradient methods with non-convex combination to solve the pseudomonotone equilibrium problems in Hilbert space and prove the strong convergence for the constructed algorithms. Our algorithms are very different with the existing ones in the literatures. As the application, the fixed point theorems for strict pseudo-contraction are considered. Finally, some numerical examples are given to show the effectiveness of the algorithms.


Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2381-2391
Author(s):  
Jenwit Puangpee ◽  
Suthep Suantai

In this paper, we introduce two hybrid algorithms for finding a common best proximity point of two best proximally nonexpansive mappings. We establish strong convergence theorems of the proposed algorithms under some control conditions in a real Hilbert space. Moreover, some numerical examples are given for supporting our main theorems.


Sign in / Sign up

Export Citation Format

Share Document