Back to Search
Start Over
The Ball-Relaxed Gradient-Projection Algorithm for Split Feasibility Problem.
- Source :
-
Journal of Function Spaces . 4/12/2022, p1-6. 6p. - Publication Year :
- 2022
-
Abstract
- In this paper, we concern with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying Gradient-projection algorithm which is used to solve constrained convex minimization problem of a real valued convex function, we construct two new algorithms for the split feasibility problem and prove that both of them are convergent weakly to a solution of the feasibility problem. In the end, as an application, we obtain a new algorithm for solving the split equality problem. [ABSTRACT FROM AUTHOR]
- Subjects :
- *CONVEX sets
*ALGORITHMS
*CONSTRAINED optimization
*CONVEX functions
Subjects
Details
- Language :
- English
- ISSN :
- 23148896
- Database :
- Academic Search Index
- Journal :
- Journal of Function Spaces
- Publication Type :
- Academic Journal
- Accession number :
- 156271218
- Full Text :
- https://doi.org/10.1155/2022/9991466