Accelerated alternating descent methods for Dykstra-like problems (Q1704007)
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: Accelerated alternating descent methods for Dykstra-like problems |
scientific article; zbMATH DE number 6848108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accelerated alternating descent methods for Dykstra-like problems |
scientific article; zbMATH DE number 6848108 |
Statements
Accelerated alternating descent methods for Dykstra-like problems (English)
0 references
8 March 2018
0 references
alternating minimizations
0 references
block descent algorithms
0 references
accelerated methods
0 references
total variation minimization
0 references
0 references
0 references
0 references
0.8174943327903748
0 references
0.7939411401748657
0 references
0.7867271900177002
0 references
0.7702054381370544
0 references
0.7643306255340576
0 references
