Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653)
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: Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems |
scientific article |
Statements
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (English)
0 references
25 January 2021
0 references
convex optimization
0 references
saddle point problems
0 references
first-order methods
0 references
information-based complexity
0 references
lower complexity bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.871139407157898
0 references
0.7610955238342285
0 references
0.757309079170227
0 references
0.7525061368942261
0 references
0.7458131313323975
0 references
