Iterative algorithm for solving a class of convex feasibility problem (Q1736385)
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: Iterative algorithm for solving a class of convex feasibility problem |
scientific article; zbMATH DE number 7042031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative algorithm for solving a class of convex feasibility problem |
scientific article; zbMATH DE number 7042031 |
Statements
Iterative algorithm for solving a class of convex feasibility problem (English)
0 references
26 March 2019
0 references
convex feasibility problem
0 references
projection formula
0 references
relaxed alternating projection algorithm
0 references
quantum computation
0 references
0 references
0 references
0 references
0 references
0 references
0.9854915
0 references
0.9353652
0 references
0.93474007
0 references
0.9334117
0 references
0.9324103
0 references
0 references
