Polyak's gradient method for split feasibility problem constrained by level sets (Q2413285)
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 6857572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polyak's gradient method for split feasibility problem constrained by level sets |
scientific article; zbMATH DE number 6857572 |
Statements
Polyak's gradient method for split feasibility problem constrained by level sets (English)
0 references
10 April 2018
0 references
split feasibility problem
0 references
projection algorithms
0 references
CQ algorithm
0 references
level sets
0 references
0 references
0 references
0 references
0 references
0 references
0.8580589294433594
0 references
0.8194817304611206
0 references
0.814768373966217
0 references
0.8108606338500977
0 references
0.8099339604377747
0 references
