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

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Kanyanee Saechou ◽  
Atid Kangtunyakarn

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.

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 916
Author(s):  
Anchalee Sripattanet ◽  
Atid Kangtunyakarn

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.


2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Ming Tian ◽  
Jun-Ying Gong

As is known, the regularization method plays an important role in solving constrained convex minimization problems. Based on the idea of regularization, implicit and explicit iterative algorithms are proposed in this paper and the sequences generated by the algorithms can converge strongly to a solution of the constrained convex minimization problem, which also solves a certain variational inequality. As an application, we also apply the algorithm to solve the split feasibility problem.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Zhangsong Yao ◽  
Sun Young Cho ◽  
Shin Min Kang ◽  
Li-Jun Zhu

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.


2015 ◽  
Vol 31 (3) ◽  
pp. 349-357
Author(s):  
ABDUL RAHIM KHAN ◽  
◽  
MUJAHID ABBAS ◽  
YEKINI SHEHU ◽  
◽  
...  

We establish strong convergence result of split feasibility problem for a family of quasi-nonexpansive multi-valued mappings and a total asymptotically strict pseudo-contractive mapping in infinite dimensional Hilbert spaces.


2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Youli Yu

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


Author(s):  
Yan Tang ◽  
Pongsakorn Sunthrayuth

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.


Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 156 ◽  
Author(s):  
Chanjuan Pan ◽  
Yuanheng Wang

In this article, we study a modified viscosity splitting method combined with inertial extrapolation for accretive operators in Banach spaces and then establish a strong convergence theorem for such iterations under some suitable assumptions on the sequences of parameters. As an application, we extend our main results to solve the convex minimization problem. Moreover, the numerical experiments are presented to support the feasibility and efficiency of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document