Results 251 to 260 of about 304,321 (280)

Some New Classes of Quasi Split Feasibility Problems

Applied Mathematics & Information Sciences, 2013
In thispaper, we introduce and consider a new problem of finding u2 K(u) such that Au2 C, where K : u! K(u) is a closed convex-valued set in the real Hilbert space H1, C is closed convex set in the real Hilbert space H2 respectively and A is linear bounded self-adjoint operator from H1 and H2. This problem is called the quasi split feasibility problem.
Muhammad Aslam Noor, Khalida Inayat Noor
openaire   +1 more source

Nonlinear iteration method for proximal split feasibility problems

Mathematical Methods in the Applied Sciences, 2017
The purpose of this paper is to introduce iterative algorithm which is a combination of hybrid viscosity approximation method and the hybrid steepest‐descent method for solving proximal split feasibility problems and obtain the strong convergence of the sequences generated by the iterative scheme under certain weaker conditions in Hilbert spaces.
Yekini Shehu, Olaniyi S. Iyiola
openaire   +2 more sources

Several solution methods for the split feasibility problem

Inverse Problems, 2005
The authors generalize the Krasnoselskii-Mann theorem and present several algorithms to solve the split feasibility problem (SFP) \(x^{k+1}=P_C(x^k-yA^T(I-P_Q)Ax^k)\) in case the projections \(P_C\) and \(P_Q\) of the algorithm proposed by \textit{Ch. Byrne} [Inverse Probl. 18, No. 2, 441-453 (2002; Zbl 0996.65048)], are difficult or even impossible to
Zhao, Jinling, Yang, Qingzhi
openaire   +2 more sources

Iterative Methods for Generalized Split Feasibility Problems in Hilbert Spaces

Set-Valued and Variational Analysis, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takahashi, Wataru, Xu, Hong-Kun, Yao, Jen-Chin   +2 more
openaire   +2 more sources

Projection methods for the linear split feasibility problems

Optimization, 2008
Some optimization problems can be reduced to finding a solution of a system of linear inequalities which belongs to a closed convex subset. In some optimization methods such a solution (or at least a better approximation of such a solution than the current one) should be found in each iteration.
openaire   +1 more source

On inertial non-lipschitz stepsize algorithms for split feasibility problems

Computational and Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Xiaojun, Jia, Zhifu, Li, Qun
openaire   +2 more sources

Projection Algorithms for Solving the Split Feasibility Problem with Multiple Output Sets

Journal of Optimization Theory and Applications, 2021
Simeon Reich
exaly  

The split feasibility problem with multiple output sets in Hilbert spaces

Optimization Letters, 2020
Simeon Reich
exaly  

Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces

Numerical Algorithms, 2020
Qiao-Li Dong, D R Sahu
exaly  

Gradient methods with selection technique for the multiple-sets split feasibility problem

Optimization, 2020
Yong-Hong Yao, Mihai Postolache, Zhichuan Zhu   +2 more
exaly