Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
