Relaxed extragradient algorithms for the split feasibility problem (Q1714613)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7010642
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relaxed extragradient algorithms for the split feasibility problem |
scientific article; zbMATH DE number 7010642 |
Statements
Relaxed extragradient algorithms for the split feasibility problem (English)
0 references
1 February 2019
0 references
Summary: The purpose of this paper is to introduce a new relaxed extragradient algorithms for the split feasibility problem. Our relaxed extragradient algorithm is new and it generalized some results for solving the split feasibility problem.
0 references
0.8595281839370728
0 references
0.8519887328147888
0 references
0.8509266376495361
0 references
0.8499146103858948
0 references
0.8431082963943481
0 references
