Self-Adaptive and Relaxed Self-Adaptive Projection Methods for Solving the Multiple-Set Split Feasibility Problem
Given nonempty closed convex subsets , and nonempty closed convex subsets , , in the - and -dimensional Euclidean spaces, respectively. The multiple-set split feasibility problem (MSSFP) proposed by Censor is to find a vector such that , where is a given real matrix. It serves as a model for man...
Saved in:
| Main Authors: | Ying Chen, Yuansheng Guo, Yanrong Yu, Rudong Chen |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2012/958040 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Ball-Relaxed Gradient-Projection Algorithm for Split Feasibility Problem
by: Xiaochun Li, et al.
Published: (2022-01-01) -
New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces
by: Haiying Li, et al.
Published: (2021-01-01) -
Relaxed Extragradient Algorithms for the Split Feasibility Problem
by: Youli Yu, et al.
Published: (2014-01-01) -
Hybrid Inertial Self-Adaptive Iterative Methods for Split Variational Inclusion Problems
by: Doaa Filali, et al.
Published: (2025-05-01) -
Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
by: Hasanen A. Hammad, et al.
Published: (2021-01-01)