scholarly journals Convergence Analysis of a Three-Step Iterative Algorithm for Generalized Set-Valued Mixed-Ordered Variational Inclusion Problem

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 444
Author(s):  
Praveen. Agarwal ◽  
Doaa Filali ◽  
M. Akram ◽  
M. Dilshad
Keyword(s):  
Iterative Algorithm ◽  
Hilbert Spaces ◽  
Resolvent Operator ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Existence And Uniqueness Results ◽  
Variational Inclusion Problem ◽  
Uniqueness Results ◽  
Convergence Results ◽  
The Resolvent Operator

This manuscript aims to study a generalized, set-valued, mixed-ordered, variational inclusion problem involving H(·,·)-compression XOR-αM-non-ordinary difference mapping and relaxed cocoercive mapping in real-ordered Hilbert spaces. The resolvent operator associated with H(·,·)-compression XOR-αM-non-ordinary difference mapping is defined, and some of its characteristics are discussed. We prove existence and uniqueness results for the considered generalized, set-valued, mixed-ordered, variational inclusion problem. Further, we put forward a three-step iterative algorithm using a ⊕ operator, and analyze the convergence of the suggested iterative algorithm under some mild assumptions. Finally, we reconfirm the existence and convergence results by an illustrative numerical example.

scholarly journals Generalized Implicit Set-Valued Variational Inclusion Problem with ⊕ Operation

Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 421
Author(s):  
Rais Ahmad ◽  
Imran Ali ◽  
Saddam Husain ◽  
A. Latif ◽  
Ching-Feng Wen
Keyword(s):  
Resolvent Operator ◽  
Convergence Result ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Variational Inclusion Problem ◽  
Special Cases ◽  
The Resolvent Operator

In this paper, we consider a resolvent operator which depends on the composition of two mappings with ⊕ operation. We prove some of the properties of the resolvent operator, that is, that it is single-valued as well as Lipschitz-type-continuous. An existence and convergence result is proven for a generalized implicit set-valued variational inclusion problem with ⊕ operation. Some special cases of a generalized implicit set-valued variational inclusion problem with ⊕ operation are discussed. An example is constructed to illustrate some of the concepts used in this paper.

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 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 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 Projection Algorithms for Variational Inclusions

2012 ◽  
Vol 2012 ◽  
pp. 1-11
Author(s):  
Youli Yu ◽  
Pei-Xia Yang ◽  
Khalida Inayat Noor
Keyword(s):  
Hilbert Space ◽  
Variational Inequality ◽  
Iterative Algorithm ◽  
Real Hilbert Space ◽  
Projection Algorithm ◽  
Variational Inclusion ◽  
Inclusion Problem ◽  
Variational Inclusions ◽  
Projection Algorithms ◽  
Variational Inclusion Problem

We present a projection algorithm for finding a solution of a variational inclusion problem in a real Hilbert space. Furthermore, we prove that the proposed iterative algorithm converges strongly to a solution of the variational inclusion problem which also solves some variational inequality.

Sign in / Sign up

Export Citation Format

Share Document