Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (Q2841142)
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: Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem |
scientific article; zbMATH DE number 6190696
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem |
scientific article; zbMATH DE number 6190696 |
Statements
Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (English)
0 references
24 July 2013
0 references
alternating projection method
0 references
convex feasibility problem
0 references
relaxed technology
0 references
halfspace
0 references
0 references
0.91674155
0 references
0.89905095
0 references
0.8834566
0 references
0.87570715
0 references
0.8741269
0 references
0.8704999
0 references
