Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367)
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: Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions |
scientific article |
Statements
Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (English)
0 references
4 September 2019
0 references
Dykstra's splitting
0 references
proximal point algorithm
0 references
block coordinate minimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7764676809310913
0 references
0.7750515341758728
0 references
0.7702348828315735
0 references
