An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems (Q4594855)
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: An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems |
scientific article; zbMATH DE number 6812881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems |
scientific article; zbMATH DE number 6812881 |
Statements
An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems (English)
0 references
24 November 2017
0 references
convex programming
0 references
complexity
0 references
ergodic convergence
0 references
maximal monotone operator
0 references
hybrid proximal extragradient method
0 references
accelerated gradient method
0 references
inexact proximal method
0 references
saddle-point problem
0 references
Bregman distances
0 references
0.9049685001373292
0 references
0.8179937601089478
0 references
0.8079316020011902
0 references
0.7963079810142517
0 references
