scholarly journals Multi-Step Inertial Hybrid and Shrinking Tseng’s Algorithm with Meir–Keeler Contractions for Variational Inclusion Problems

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1548
Author(s):  
Yuanheng Wang ◽  
Mingyue Yuan ◽  
Bingnan Jiang
Keyword(s):  
Projection Method ◽  
Hilbert Spaces ◽  
Iterative Algorithms ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Inertial Method ◽  
Inclusion Problems ◽  
Variational Inclusion Problem ◽  
Convex Minimization Problems ◽  
Tseng’S Method

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.

scholarly journals Strong Convergence of a New Iterative Algorithm for Split Monotone Variational Inclusion Problems

Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 123 ◽  
Author(s):  
Lu-Chuan Ceng ◽  
Qing Yuan
Keyword(s):  
Iterative Method ◽  
Hilbert Spaces ◽  
Optimization Problem ◽  
Variational Inclusion ◽  
Hierarchical Optimization ◽  
Inclusion Problem ◽  
Inclusion Problems ◽  
Infinite Dimensional ◽  
Variational Inclusion Problem ◽  
General Iterative Method

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.

scholarly journals A Modified Tseng’s Method for Solving the Modified Variational Inclusion Problems and Its Applications

Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2250
Author(s):  
Thidaporn Seangwattana ◽  
Kamonrat Sombut ◽  
Areerat Arunchai ◽  
Kanokwan Sitthithakerngkiet
Keyword(s):  
Signal To Noise Ratio ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Noisy Image ◽  
Inclusion Problems ◽  
Variational Inclusion Problem ◽  
Symmetry Properties ◽  
Weak Convergence Theorem ◽  
Tseng’S Method ◽  
Parallel Technique

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.

scholarly journals A modified proximal point algorithm for solving variational inclusion problem in real Hilbert spaces

2020 ◽  
Vol 2020 (1) ◽  
pp. 28-39
Author(s):  
Thierno M. M. Sow
Keyword(s):  
Iterative Algorithm ◽  
Hilbert Spaces ◽  
Proximal Point Algorithm ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Proximal Point ◽  
Inclusion Problems ◽  
Common Solution ◽  
Variational Inclusion Problem ◽  
The Common

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.

scholarly journals Two self-adaptive inertial projection algorithms for solving split variational inclusion problems

2021 ◽  
Vol 7 (4) ◽  
pp. 4960-4973
Author(s):  
Zheng Zhou ◽  
◽  
Bing Tan ◽  
Songxiao Li
Keyword(s):  
Hilbert Spaces ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Projection Algorithms ◽  
Approximation Solution ◽  
Inclusion Problems ◽  
Variational Inclusion Problem ◽  
Adaptive Stepsize ◽  
The Given ◽  
Self Adaptive

<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>

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
Keyword(s):  
Iterative Algorithms ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Iterative Regularization ◽  
Regularization Technique ◽  
Inclusion Problems ◽  
Variational Inclusion Problem ◽  
Computational Performance ◽  
Split Feasibility ◽  
New Algorithms

<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>

scholarly journals Modified Proximal Algorithms for Finding Solutions of the Split Variational Inclusions

Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 708 ◽  
Author(s):  
Suthep Suantai ◽  
Suparat Kesornprom ◽  
Prasit Cholamjiak
Keyword(s):  
Hilbert Spaces ◽  
Numerical Experiments ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Signal Recovery ◽  
Proximal Algorithms ◽  
Split Variational Inclusion Problem ◽  
Variational Inclusion Problem ◽  
Lipschitz Constants ◽  
Theoretical Results

We investigate the split variational inclusion problem in Hilbert spaces. We propose efficient algorithms in which, in each iteration, the stepsize is chosen self-adaptive, and proves weak and strong convergence theorems. We provide numerical experiments to validate the theoretical results for solving the split variational inclusion problem as well as the comparison to algorithms defined by Byrne et al. and Chuang, respectively. It is shown that the proposed algorithms outrun other algorithms via numerical experiments. As applications, we apply our method to compressed sensing in signal recovery. The proposed methods have as a main advantage that the computation of the Lipschitz constants for the gradient of functions is dropped in generating the sequences.

scholarly journals An Iterative Method for Solving Split Monotone Variational Inclusion Problems and Finite Family of Variational Inequality Problems in Hilbert Spaces

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Wanna Sriprad ◽  
Somnuk Srisawat
Keyword(s):  
Variational Inequality ◽  
Real Hilbert Space ◽  
Finite Family ◽  
Variational Inequality Problems ◽  
Variational Inclusion ◽  
Common Element ◽  
Strong Convergence Theorem ◽  
Inclusion Problem ◽  
Variational Inclusion Problem ◽  
Convex Minimization Problems

The purpose of this paper is to study the convergence analysis of an intermixed algorithm for finding the common element of the set of solutions of split monotone variational inclusion problem (SMIV) and the set of a finite family of variational inequality problems. Under the suitable assumption, a strong convergence theorem has been proved in the framework of a real Hilbert space. In addition, by using our result, we obtain some additional results involving split convex minimization problems (SCMPs) and split feasibility problems (SFPs). Also, we give some numerical examples for supporting our main theorem.

Sign in / Sign up

Export Citation Format

Share Document