scholarly journals Iterative scheme for finding solutions of the general split feasibility problem and the general constrained minimization problems

Filomat ◽  
2019 ◽  
Vol 33 (1) ◽  
pp. 233-243
Author(s):  
Atid Kangtunyakarn
Keyword(s):  
Iterative Scheme ◽  
Split Feasibility Problem ◽  
Constrained Minimization ◽  
Feasibility Problem ◽  
Minimization Problems ◽  
Constrained Minimization Problems ◽  
Split Feasibility

scholarly journals Latent Infectious Capacities of Dengue Fever: Mathematical Modeling and Eco-Friendly Prevention Strategy

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 263
Author(s):  
Chung-Chien Hong ◽  
Wei-Shih Du ◽  
Yu-Hong Ge
Keyword(s):  
Mathematical Modeling ◽  
Dengue Fever ◽  
Iterative Scheme ◽  
High Capacity ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Public Data ◽  
The Split Feasibility Problem ◽  
Split Feasibility ◽  
Kaohsiung City

The main aim of this article is to propose a method for exploring the latent values about the capacities of spreading dengue for each potential site. First, a mathematical model connecting the observable public data and the capacities of spreading dengue is provided based on the split feasibility problem (SFP). Then, a proper iterative scheme for the SFP is presented to approach the values of infectious capacities (ICs) of potential sites—the capacities of spreading. The performance of our proposed method is demonstrated using public data from Kaohsiung City for 2014 and 2015. The results presented in this paper show that our proposed method is reliable and the sites with a high capacity of spreading are only a small portion of thousands of all potential sites and could be an alternative strategy for preventing the outbreak of dengue fever whilst also avoiding the damage of ecosystems caused by chemical insecticides.

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 General Iterative Scheme Based on Regularization for Solving Equilibrium and Constrained Convex Minimization Problems

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Ming Tian
Keyword(s):  
Equilibrium Problem ◽  
Split Feasibility Problem ◽  
Convex Minimization ◽  
Feasibility Problem ◽  
Constrained Convex Minimization ◽  
Common Solution ◽  
Minimization Problems ◽  
Convex Minimization Problems ◽  
Implicit And Explicit ◽  
Split Feasibility

The present paper is divided into two parts. First, we introduce implicit and explicit iterative schemes based on the regularization for solving equilibrium and constrained convex minimization problems. We establish results on the strong convergence of the sequences generated by the proposed schemes to a common solution of minimization and equilibrium problem. Such a point is also a solution of a variational inequality. In the second part, as applications, we apply the algorithm to solve split feasibility problem and equilibrium problem.

Ball-relaxed projection algorithms for multiple-sets split feasibility problem

Optimization ◽  
2021 ◽  
pp. 1-31
Author(s):  
Guash Haile Taddele ◽  
Poom Kumam ◽  
Anteneh Getachew Gebrie ◽  
Jamilu Abubakar
Keyword(s):  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Projection Algorithms ◽  
Split Feasibility

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.

Sign in / Sign up

Export Citation Format

Share Document