scholarly journals New iterative regularization methods for solving split variational inclusion problems

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Dang Van Hieu ◽  
Le Dung Muu ◽  
Pham Kim Quy

<p style='text-indent:20px;'>The paper proposes some new iterative algorithms for solving a split variational inclusion problem involving maximally monotone multi-valued operators in a Hilbert space. The algorithms are constructed around the resolvent of operator and the regularization technique to get the strong convergence. Some stepsize rules are incorporated to allow the algorithms to work easily. An application of the proposed algorithms to split feasibility problems is also studied. The computational performance of the new algorithms in comparison with others is shown by some numerical experiments.</p>

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1548
Author(s):  
Yuanheng Wang ◽  
Mingyue Yuan ◽  
Bingnan Jiang

In our paper, we propose two new iterative algorithms with Meir–Keeler contractions that are based on Tseng’s method, the multi-step inertial method, the hybrid projection method, and the shrinking projection method to solve a monotone variational inclusion problem in Hilbert spaces. The strong convergence of the proposed iterative algorithms is proven. Using our results, we can solve convex minimization problems.


Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 123 ◽  
Author(s):  
Lu-Chuan Ceng ◽  
Qing Yuan

The main aim of this work is to introduce an implicit general iterative method for approximating a solution of a split variational inclusion problem with a hierarchical optimization problem constraint for a countable family of mappings, which are nonexpansive, in the setting of infinite dimensional Hilbert spaces. Convergence theorem of the sequences generated in our proposed implicit algorithm is obtained under some weak assumptions.


Author(s):  
M. Akram ◽  
A.F. Aljohani ◽  
M. Dilshad ◽  
Aysha Khan

In this paper, we pose a new iterative algorithm and show that this newly constructed algorithm converges faster than some existing iterative algorithms. We validate our claim by an illustrative example. Also, we discuss the convergence of our algorithm to approximate the solution of a general variational inclusion problem. Also, we present a numerical example to verify our existence and convergence result. Finally, we apply our proposed iterative algorithm to solve a delay differential equation as an application


Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2250
Author(s):  
Thidaporn Seangwattana ◽  
Kamonrat Sombut ◽  
Areerat Arunchai ◽  
Kanokwan Sitthithakerngkiet

The goal of this study was to show how a modified variational inclusion problem can be solved based on Tseng’s method. In this study, we propose a modified Tseng’s method and increase the reliability of the proposed method. This method is to modify the relaxed inertial Tseng’s method by using certain conditions and the parallel technique. We also prove a weak convergence theorem under appropriate assumptions and some symmetry properties and then provide numerical experiments to demonstrate the convergence behavior of the proposed method. Moreover, the proposed method is used for image restoration technology, which takes a corrupt/noisy image and estimates the clean, original image. Finally, we show the signal-to-noise ratio (SNR) to guarantee image quality.


2020 ◽  
Vol 2020 (1) ◽  
pp. 28-39
Author(s):  
Thierno M. M. Sow

AbstractThe purpose of this paper is to use a modified proximal point algorithm for solving variational inclusion problem in real Hilbert spaces. It is proven that the sequence generated by the proposed iterative algorithm converges strongly to the common solution of the convex minimization and variational inclusion problems.


2021 ◽  
Vol 7 (4) ◽  
pp. 4960-4973
Author(s):  
Zheng Zhou ◽  
◽  
Bing Tan ◽  
Songxiao Li

<abstract><p>This paper is to analyze the approximation solution of a split variational inclusion problem in the framework of Hilbert spaces. For this purpose, inertial hybrid and shrinking projection algorithms are proposed under the effect of a self-adaptive stepsize which does not require information of the norms of the given operators. The strong convergence properties of the proposed algorithms are obtained under mild constraints. Finally, a numerical experiment is given to illustrate the performance of proposed methods and to compare our algorithms with an existing algorithm.</p></abstract>


Sign in / Sign up

Export Citation Format

Share Document