A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292)
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: A dual Bregman proximal gradient method for relatively-strongly convex optimization |
scientific article; zbMATH DE number 7611140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual Bregman proximal gradient method for relatively-strongly convex optimization |
scientific article; zbMATH DE number 7611140 |
Statements
A dual Bregman proximal gradient method for relatively-strongly convex optimization (English)
0 references
2 November 2022
0 references
relatively strong convexity
0 references
dual method
0 references
Bregman distance
0 references
relative smoothness
0 references
0 references
0 references
0 references
0.9191847
0 references
0.91891164
0 references
0.9189006
0 references
0.91751695
0 references
0.9084409
0 references
0.90493476
0 references
0.90402764
0 references
0.90351534
0 references
