scholarly journals Adaptively relaxed algorithms for solving the split feasibility problem with a new step size

2014 ◽  
Vol 2014 (1) ◽  
Author(s):  
Haiyun Zhou ◽  
Peiyuan Wang
Keyword(s):  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Step Size ◽  
The Split Feasibility Problem ◽  
Split Feasibility

scholarly journals New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Haiying Li ◽  
Yulian Wu ◽  
Fenghui Wang
Keyword(s):  
Hilbert Spaces ◽  
Split Feasibility Problem ◽  
Linear Operators ◽  
Feasibility Problem ◽  
Variable Step Size ◽  
Step Size ◽  
Bounded Linear ◽  
Variable Step ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The split feasibility problem SFP has received much attention due to its various applications in signal processing and image reconstruction. In this paper, we propose two inertial relaxed C Q algorithms for solving the split feasibility problem in real Hilbert spaces according to the previous experience of applying inertial technology to the algorithm. These algorithms involve metric projections onto half-spaces, and we construct new variable step size, which has an exact form and does not need to know a prior information norm of bounded linear operators. Furthermore, we also establish weak and strong convergence of the proposed algorithms under certain mild conditions and present a numerical experiment to illustrate the performance of the proposed algorithms.

scholarly journals Self adaptive inertial relaxed $ CQ $ algorithms for solving split feasibility problem with multiple output sets

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Guash Haile Taddele ◽  
Poom Kumam ◽  
Habib ur Rehman ◽  
Anteneh Getachew Gebrie
Keyword(s):  
Hilbert Spaces ◽  
Convex Sets ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Weak And Strong Convergence ◽  
Step Size ◽  
The Split Feasibility Problem ◽  
Adaptive Step ◽  
Split Feasibility ◽  
Self Adaptive

<p style='text-indent:20px;'>In this paper, we propose two new self-adaptive inertial relaxed <inline-formula><tex-math id="M2">\begin{document}$ CQ $\end{document}</tex-math></inline-formula> algorithms for solving the split feasibility problem with multiple output sets in the framework of real Hilbert spaces. The proposed algorithms involve computing projections onto half-spaces instead of onto the closed convex sets, and the advantage of the self-adaptive step size introduced in our algorithms is that it does not require the computation of operator norm. We establish and prove weak and strong convergence theorems for the iterative sequences generated by the introduced algorithms for solving the aforementioned problem. Moreover, we apply the new results to solve some other problems. Finally, we present some numerical examples to illustrate the implementation of our algorithms and compared them to some existing results.</p>

scholarly journals The Split Feasibility Problem and Its Solution Algorithm

2018 ◽  
Vol 2018 ◽  
pp. 1-7
Author(s):  
Biao Qu ◽  
Binghua Liu
Keyword(s):  
Signal Processing ◽  
Real World ◽  
Lipschitz Constant ◽  
Split Feasibility Problem ◽  
Solution Algorithm ◽  
Feasibility Problem ◽  
Step Size ◽  
Convergence Results ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The split feasibility problem arises in many fields in the real world, such as signal processing, image reconstruction, and medical care. In this paper, we present a solution algorithm called memory gradient projection method for solving the split feasibility problem, which employs a parameter and two previous iterations to get the next iteration, and its step size can be calculated directly. It not only improves the flexibility of the algorithm, but also avoids computing the largest eigenvalue of the related matrix or estimating the Lipschitz constant in each iteration. Theoretical convergence results are established under some suitable conditions.

scholarly journals An Extrapolated Iterative Algorithm for Multiple-Set Split Feasibility Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Yazheng Dang ◽  
Yan Gao
Keyword(s):  
Iterative Algorithm ◽  
Numerical Experiments ◽  
Convex Sets ◽  
Lipschitz Constant ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Step Size ◽  
Fixed Constant ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The multiple-set split feasibility problem (MSSFP), as a generalization of the split feasibility problem, is to find a point in the intersection of a family of closed convex sets in one space such that its image under a linear transformation will be in the intersection of another family of closed convex sets in the image space. Censor et al. (2005) proposed a method for solving the multiple-set split feasibility problem (MSSFP), whose efficiency depends heavily on the step size, a fixed constant related to the Lipschitz constant of∇p(x)which may be slow. In this paper, we present an accelerated algorithm by introducing an extrapolated factor to solve the multiple-set split feasibility problem. The framework encompasses the algorithm presented by Censor et al. (2005). The convergence of the method is investigated, and numerical experiments are provided to illustrate the benefits of the extrapolation.

scholarly journals A New Hybrid CQ Algorithm for the Split Feasibility Problem in Hilbert Spaces and Its Applications to Compressed Sensing

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 789 ◽  
Author(s):  
Suthep Suantai ◽  
Suparat Kesornprom ◽  
Prasit Cholamjiak
Keyword(s):  
Compressed Sensing ◽  
Line Search ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Step Size ◽  
Cq Algorithm ◽  
Line Search Techniques ◽  
Weak Convergence Theorem ◽  
The Split Feasibility Problem ◽  
Split Feasibility

In this paper, we focus on studying the split feasibility problem (SFP), which has many applications in signal processing and image reconstruction. A popular technique is to employ the iterative method which is so called the relaxed CQ algorithm. However, the speed of convergence usually depends on the way of selecting the step size of such algorithms. We aim to suggest a new hybrid CQ algorithm for the SFP by using the self adaptive and the line-search techniques. There is no computation on the inverse and the spectral radius of a matrix. We then prove the weak convergence theorem under mild conditions. Numerical experiments are included to illustrate its performance in compressed sensing. Some comparisons are also given to show the efficiency with other CQ methods in the literature.

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.

Sign in / Sign up

Export Citation Format

Share Document