A relaxed alternating CQ-algorithm for convex feasibility problems (Q1934995)
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 6132807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relaxed alternating CQ-algorithm for convex feasibility problems |
scientific article; zbMATH DE number 6132807 |
Statements
A relaxed alternating CQ-algorithm for convex feasibility problems (English)
0 references
30 January 2013
0 references
convex feasibility problem
0 references
CQ-algorithm
0 references
relaxed alternating algorithm
0 references
0.912166714668274
0 references
0.8757229447364807
0 references
0.8603114485740662
0 references
0.8588957190513611
0 references
