Dykstras algorithm with bregman projections: A convergence proof (Q2709445)
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: Dykstras algorithm with bregman projections: A convergence proof |
scientific article; zbMATH DE number 1586150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dykstras algorithm with bregman projections: A convergence proof |
scientific article; zbMATH DE number 1586150 |
Statements
Dykstras algorithm with bregman projections: A convergence proof (English)
0 references
27 November 2001
0 references
Han's algorithm
0 references
Hildreth's method
0 references
Dykstra's algorithm
0 references
cyclic Bregman projections
0 references
best approximation
0 references
convex feasibility
0 references
Bregman distances
0 references
Legendre functions
0 references
0 references
0 references
0 references
0 references
0 references
0.8072956204414368
0 references
0.8063613772392273
0 references
0.8048674464225769
0 references
