On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem (Q2189407)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem |
scientific article; zbMATH DE number 7212123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem |
scientific article; zbMATH DE number 7212123 |
Statements
On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem (English)
0 references
15 June 2020
0 references
A certain algorithm is developed for solving the split feasibility problem by using variable stepsizes. A convergence analysis of the algorithm is provided. Numerical experiments demonstrate that the new algorithm outperforms earlier ones using similar information.
0 references
split feasibility problem
0 references
CQ algorithm
0 references
Hilbert space
0 references
gradient method
0 references
0 references
0 references
0 references
0 references
0 references
0.94918984
0 references
0.9410031
0 references
0.9374472
0 references
0.93213314
0 references
0.9316981
0 references
0.9201185
0 references
0.91086817
0 references
0.91053486
0 references
0.90950775
0 references
