Split feasibility and fixed point problems
QH Ansari, A Rehan - Nonlinear analysis: approximation theory …, 2014 - Springer
In this survey article, we present an introduction of split feasibility problems, multisets split
feasibility problems and fixed point problems. The split feasibility problems and multisets …
feasibility problems and fixed point problems. The split feasibility problems and multisets …
Algorithms for the split variational inequality problem
We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called
the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of …
the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of …
Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
HK Xu - Inverse problems, 2010 - iopscience.iop.org
The split feasibility problem (SFP)(Censor and Elfving 1994 Numer. Algorithms 8 221–39) is
to find a point x* with the property that x*∊ C and Ax*∊ Q, where C and Q are the nonempty …
to find a point x* with the property that x*∊ C and Ax*∊ Q, where C and Q are the nonempty …
[图书][B] Some geometric properties of Banach spaces
C Chidume - 2009 - Springer
In the first part of this monograph (Chapters 1 to 5), we explore selected geometric
properties of Banach spaces that will play crucial roles in our study of iterative algorithms for …
properties of Banach spaces that will play crucial roles in our study of iterative algorithms for …
Split monotone variational inclusions
A Moudafi - Journal of Optimization Theory and Applications, 2011 - Springer
Based on the very recent work by Censor-Gibali-Reich (http://arxiv. org/abs/1009.3780), we
propose an extension of their new variational problem (Split Variational Inequality Problem) …
propose an extension of their new variational problem (Split Variational Inequality Problem) …
Solving the split feasibility problem without prior knowledge of matrix norms
The split feasibility problem (SFP) consists in finding a point in a given closed convex subset
of a Hilbert space such that its image under a bounded linear operator belongs to a given …
of a Hilbert space such that its image under a bounded linear operator belongs to a given …
The split common fixed-point problem for demicontractive mappings
A Moudafi - Inverse Problems, 2010 - iopscience.iop.org
Based on the very recent work by Censor and Segal (2009 J. Convex Anal. 16 587–600)
and inspired by Xu (2006 Inverse Problems 22 2021–34) and Yang (2004 Inverse Problems …
and inspired by Xu (2006 Inverse Problems 22 2021–34) and Yang (2004 Inverse Problems …
Averaged mappings and the gradient-projection algorithm
HK Xu - Journal of Optimization Theory and Applications, 2011 - Springer
It is well known that the gradient-projection algorithm (GPA) plays an important role in
solving constrained convex minimization problems. In this article, we first provide an …
solving constrained convex minimization problems. In this article, we first provide an …
[PDF][PDF] Alternating CQ-algorithm for convex feasibility and split fixed-point problems
A Moudafi - J. Nonlinear Convex Anal, 2014 - researchgate.net
Alternating CQ-algorithms for convex feasibility and split fixed-point problems Page 1
Alternating CQ-algorithms for convex feasibility and split fixed-point problems A. Moudafi …
Alternating CQ-algorithms for convex feasibility and split fixed-point problems A. Moudafi …