scholarly journals Convergence Theorem of Two Sequences for Solving the Modified Generalized System of Variational Inequalities and Numerical Analysis

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 916
Author(s):  
Anchalee Sripattanet ◽  
Atid Kangtunyakarn
Keyword(s):  
Variational Inequalities ◽  
Convergence Theorem ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
System Of Variational Inequalities ◽  
Generalized System ◽  
Constrained Convex Minimization Problem ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The purpose of this paper is to introduce an iterative algorithm of two sequences which depend on each other by using the intermixed method. Then, we prove a strong convergence theorem for solving fixed-point problems of nonlinear mappings and we treat two variational inequality problems which form an approximate modified generalized system of variational inequalities (MGSV). By using our main theorem, we obtain the additional results involving the split feasibility problem and the constrained convex minimization problem. In support of our main result, a numerical example is also presented.

scholarly journals An intermixed iteration for constrained convex minimization problem and split feasibility problem

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Kanyanee Saechou ◽  
Atid Kangtunyakarn
Keyword(s):  
Strong Convergence ◽  
Minimization Problem ◽  
Convergence Theorem ◽  
Split Feasibility Problem ◽  
Convex Minimization ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Convex Minimization Problem ◽  
Constrained Convex Minimization Problem ◽  
Split Feasibility

Abstract In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for the intermixed algorithm. By using our main theorem, we prove a strong convergence theorem for the split feasibility problem. Finally, we apply our main theorem for the numerical example.

An iterative algorithm with inertial technique for solving the split common null point problem in Banach spaces

2021 ◽  
pp. 2250120
Author(s):  
Yan Tang ◽  
Pongsakorn Sunthrayuth
Keyword(s):  
Banach Spaces ◽  
Split Feasibility Problem ◽  
Null Point ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Point Problem ◽  
Inertial Algorithm ◽  
The Split Feasibility Problem ◽  
Inertial Technique ◽  
Split Feasibility

In this work, we introduce a modified inertial algorithm for solving the split common null point problem without the prior knowledge of the operator norms in Banach spaces. The strong convergence theorem of our method is proved under suitable assumptions. We apply our result to the split feasibility problem, split equilibrium problem and split minimization problem. Finally, we provide some numerical experiments including compressed sensing to illustrate the performances of the proposed method. The result presented in this paper improves and generalizes many recent important results in the literature.

scholarly journals A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Yazheng Dang ◽  
Yan Gao ◽  
Yanli Han
Keyword(s):  
Convergence Theorem ◽  
Convex Set ◽  
Split Feasibility Problem ◽  
Projection Algorithm ◽  
Feasibility Problem ◽  
Asymptotic Convergence ◽  
Closed Convex Set ◽  
The Split Feasibility Problem ◽  
Inertial Technique ◽  
Split Feasibility

This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we construct an inertial perturbed projection algorithm for solving the split feasibility problem. Under some suitable conditions, we show the asymptotic convergence. The results improve and extend the algorithms presented in Byrne (2002) and in Zhao and Yang (2005) and the related convergence theorem.

scholarly journals An Explicit Method for the Split Feasibility Problem with Self-Adaptive Step Sizes

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Youli Yu
Keyword(s):  
Iterative Method ◽  
Strong Convergence ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Explicit Method ◽  
The Split Feasibility Problem ◽  
Adaptive Step ◽  
Split Feasibility ◽  
Self Adaptive

An explicit iterative method with self-adaptive step-sizes for solving the split feasibility problem is presented. Strong convergence theorem is provided.

A halpern-type iteration for solving the split feasibility problem and the fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces

Filomat ◽  
2018 ◽  
Vol 32 (9) ◽  
pp. 3211-3227 ◽  
Author(s):  
Prasit Cholamjiak ◽  
Pongsakorn Sunthrayuth
Keyword(s):  
Fixed Point ◽  
Banach Spaces ◽  
Iterative Scheme ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Nonexpansive Semigroup ◽  
Relatively Nonexpansive ◽  
The Split Feasibility Problem ◽  
Split Feasibility

We study the split feasibility problem (SFP) involving the fixed point problems (FPP) in the framework of p-uniformly convex and uniformly smooth Banach spaces. We propose a Halpern-type iterative scheme for solving the solution of SFP and FPP of Bregman relatively nonexpansive semigroup. Then we prove its strong convergence theorem of the sequences generated by our iterative scheme under implemented conditions. We finally provide some numerical examples and demonstrate the efficiency of the proposed algorithm. The obtained result of this paper complements many recent results in this direction.

scholarly journals A Modified Halpern's Iterative Scheme for Solving Split Feasibility Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Jitsupa Deepho ◽  
Poom Kumam
Keyword(s):  
Hilbert Space ◽  
Hilbert Spaces ◽  
Iterative Scheme ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Infinite Dimensional ◽  
Infinite Dimensional Hilbert Space ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The purpose of this paper is to introduce and study a modified Halpern’s iterative scheme for solving the split feasibility problem (SFP) in the setting of infinite-dimensional Hilbert spaces. Under suitable conditions a strong convergence theorem is established. The main result presented in this paper improves and extends some recent results done by Xu (Iterative methods for the split feasibility problem in infinite-dimensional Hilbert space, Inverse Problem 26 (2010) 105018) and some others.

scholarly journals A Regularized Algorithm for the Proximal Split Feasibility Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Zhangsong Yao ◽  
Sun Young Cho ◽  
Shin Min Kang ◽  
Li-Jun Zhu
Keyword(s):  
Strong Convergence ◽  
Convergence Theorem ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Split Feasibility ◽  
Regularized Method

The proximal split feasibility problem has been studied. A regularized method has been presented for solving the proximal split feasibility problem. Strong convergence theorem is given.

Sign in / Sign up

Export Citation Format

Share Document