Results 11 to 20 of about 304,321 (280)

Gradient projection method with a new step size for the split feasibility problem [PDF]

open access: yesJournal of Inequalities and Applications, 2018
In this paper, we introduce an iterative scheme using the gradient projection method with a new step size, which is not depend on the related matrix inverses and the largest eigenvalue (or the spectral radius of the self-adjoint operator) of the related ...
Pattanapong Tianchai
doaj   +2 more sources

Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces [PDF]

open access: yesJournal of Inequalities and Applications, 2016
In this paper, we propose several new iterative algorithms to solve the split feasibility problem in the Hilbert spaces. By virtue of new analytical techniques, we prove that the iterative sequence generated by these iterative procedures converges to the
Yuchao Tang, Liwei Liu
doaj   +2 more sources

Douglas–Rachford Splitting Method with Linearization for the Split Feasibility Problem [PDF]

open access: yesSymmetry, 2022
The aim of this article is to introduce the Douglas–Rachford splitting method with linearization to solve the split feasibility problem (SFP). Our proposed method includes two existing methods in work of Tang et al. and Wang as special cases. The ranges of the parameters in work of Tang et al. are extended from (0,1) to (0,2). Under standard conditions,
Ziyue Hu   +3 more
openaire   +1 more source

An Improved Alternating CQ Algorithm for Solving Split Equality Problems

open access: yesMathematics, 2021
The CQ algorithm is widely used in the scientific field and has a significant impact on phase retrieval, medical image reconstruction, signal processing, etc.
Yan-Juan He, Li-Jun Zhu, Nan-Nan Tan
doaj   +1 more source

l 1-l 2 regularization of split feasibility problems [PDF]

open access: yesNumerical Algorithms, 2017
arXiv admin note: text overlap with arXiv:1609.09530 by other ...
Abdellatif Moudafi, Aviv Gibali
openaire   +4 more sources

Strong Convergence on the Split Feasibility Problem by Mixing W-Mapping

open access: yesJournal of Mathematics, 2021
In this paper, we concern with the split feasibility problem (SFP) in real Hilbert space whenever the sets involved are nonempty, closed, and convex. By mixing W-mapping with the viscosity, we introduce a new iterative algorithm for solving the split ...
Fugen Gao, Xiaoxiao Liu, Xiaochun Li
doaj   +1 more source

Multiple-sets split feasibility problem and split equality fixed point problem for firmly quasi-nonexpansive or nonexpansive mappings

open access: yesJournal of Inequalities and Applications, 2021
In this paper, we propose a new iterative algorithm for solving the multiple-sets split feasibility problem (MSSFP for short) and the split equality fixed point problem (SEFPP for short) with firmly quasi-nonexpansive operators or nonexpansive operators ...
Tongxin Xu, Luoyi Shi
doaj   +1 more source

Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces

open access: yesJournal of Inequalities and Applications, 2018
In this paper, we are concerned with the split equality problem (SEP) in Hilbert spaces. By converting it to a coupled fixed-point equation, we propose a new algorithm for solving the SEP.
Hai Yu, Fenghui Wang
doaj   +1 more source

Multiple‐Set Split Feasibility Problems for Asymptotically Strict Pseudocontractions [PDF]

open access: yesAbstract and Applied Analysis, 2012
In this paper, we introduce an iterative method for solving the multiple‐set split feasibility problems for asymptotically strict pseudocontractions in infinite‐dimensional Hilbert spaces, and, by using the proposed iterative method, we improve and extend some recent results given by some authors.
Chang, Shih-Sen   +4 more
openaire   +3 more sources

Non-Convex Split Feasibility Problems: Models, Algorithms and Theory [PDF]

open access: yesOpen Journal of Mathematical Optimization, 2020
In this paper, we propose a catalog of iterative methods for solving the Split Feasibility Problem in the non-convex setting. We study four different optimization formulations of the problem, where each model has advantages in different settings of the problem. For each model, we study relevant iterative algorithms, some of which are well-known in this
Gibali, Aviv   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy