scholarly journals Projection Algorithms for Variational Inclusions

2012 ◽  
Vol 2012 ◽  
pp. 1-11
Author(s):  
Youli Yu ◽  
Pei-Xia Yang ◽  
Khalida Inayat Noor

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.

Author(s):  
Wanna Sriprad ◽  
Somnuk Srisawat

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.


2021 ◽  
Vol 37 (3) ◽  
pp. 361-380
Author(s):  
JAMILU ABUBAKAR ◽  
◽  
POOM KUMAM ◽  
ABOR ISA GARBA ◽  
MUHAMMAD SIRAJO ABDULLAHI ◽  
...  

Variational inclusion is an important general problem consisting of many useful problems like variational inequality, minimization problem and nonlinear monotone equations. In this article, a new scheme for solving variational inclusion problem is proposed and the scheme uses inertial and relaxation techniques. Moreover, the scheme is self adaptive, that is, the stepsize does not depend on the factorial constants of the underlying operator, instead it can be computed using a simple updating rule. Weak convergence analysis of the iterates generated by the new scheme is presented under mild conditions. In addition, schemes for solving variational inequality problem and split feasibility problem are derived from the proposed scheme and applied in solving Nash-Cournot equilibrium problem and image restoration. Experiments to illustrate the implementation and potential applicability of the proposed schemes in comparison with some existing schemes in the literature are presented.


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


2014 ◽  
Vol 2014 ◽  
pp. 1-22
Author(s):  
Lu-Chuan Ceng ◽  
Cheng-Wen Liao ◽  
Chin-Tzong Pang ◽  
Ching-Feng Wen

We introduce and analyze a hybrid iterative algorithm by combining Korpelevich's extragradient method, the hybrid steepest-descent method, and the averaged mapping approach to the gradient-projection algorithm. It is proven that, under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of finitely many nonexpansive mappings, the solution set of a generalized mixed equilibrium problem (GMEP), the solution set of finitely many variational inclusions, and the solution set of a convex minimization problem (CMP), which is also a unique solution of a triple hierarchical variational inequality (THVI) in a real Hilbert space. In addition, we also consider the application of the proposed algorithm to solving a hierarchical variational inequality problem with constraints of the GMEP, the CMP, and finitely many variational inclusions.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Araya Kheawborisut ◽  
Atid Kangtunyakarn

AbstractFor the purpose of this article, we introduce a modified form of a generalized system of variational inclusions, called the generalized system of modified variational inclusion problems (GSMVIP). This problem reduces to the classical variational inclusion and variational inequalities problems. Motivated by several recent results related to the subgradient extragradient method, we propose a new subgradient extragradient method for finding a common element of the set of solutions of GSMVIP and the set of a finite family of variational inequalities problems. Under suitable assumptions, strong convergence theorems have been proved in the framework of a Hilbert space. In addition, some numerical results indicate that the proposed method is effective.


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.


Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 444
Author(s):  
Praveen. Agarwal ◽  
Doaa Filali ◽  
M. Akram ◽  
M. Dilshad

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.


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