On lower iteration complexity bounds for the convex concave saddle point problems (Q2149573)
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 lower iteration complexity bounds for the convex concave saddle point problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lower iteration complexity bounds for the convex concave saddle point problems |
scientific article |
Statements
On lower iteration complexity bounds for the convex concave saddle point problems (English)
0 references
29 June 2022
0 references
saddle point
0 references
min-max problem
0 references
first-order method
0 references
proximal mapping
0 references
lower iteration complexity bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.871139407157898
0 references
0.7612482309341431
0 references
0.754574716091156
0 references
0.7447144389152527
0 references
0.735317587852478
0 references
