First-order algorithms converge faster than $O(1/k)$ on convex problems (Q6311428)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 900367388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | First-order algorithms converge faster than $O(1/k)$ on convex problems |
scientific article; zbMATH DE number 900367388 |
Statements
20 December 2018
0 references
