On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM (Q5221273)
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: On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM |
scientific article; zbMATH DE number 7181929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM |
scientific article; zbMATH DE number 7181929 |
Statements
On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM (English)
0 references
25 March 2020
0 references
alternating direction method of multipliers
0 references
hybrid proximal extragradient method
0 references
non-Euclidean Bregman distances
0 references
iteration-complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8341712355613708
0 references
0.797394871711731
0 references
0.7933720946311951
0 references
0.7884024381637573
0 references
